./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/960521-1_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/960521-1_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b468f3c6542f32922018ecd35f248815c64c681a62a7333b987abbfb42d9345 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:47:37,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:47:37,672 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:47:37,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:47:37,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:47:37,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:47:37,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:47:37,697 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:47:37,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:47:37,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:47:37,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:47:37,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:47:37,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:47:37,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:47:37,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:47:37,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:47:37,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:47:37,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:47:37,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:47:37,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:47:37,708 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:47:37,709 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:47:37,710 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:47:37,711 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:47:37,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:47:37,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:47:37,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:47:37,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:47:37,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:47:37,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:47:37,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:47:37,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:47:37,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:47:37,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:47:37,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:47:37,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:47:37,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:47:37,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:47:37,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:47:37,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:47:37,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:47:37,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:47:37,734 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:47:37,752 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:47:37,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:47:37,754 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:47:37,755 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:47:37,755 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:47:37,755 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:47:37,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:47:37,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:47:37,756 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:47:37,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:47:37,757 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:47:37,757 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:47:37,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:47:37,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:47:37,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:47:37,758 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:47:37,758 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:47:37,758 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:47:37,758 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:47:37,758 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:47:37,758 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:47:37,759 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:47:37,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:47:37,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:47:37,759 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:47:37,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:47:37,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:47:37,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:47:37,760 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:47:37,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:47:37,760 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 -> 2b468f3c6542f32922018ecd35f248815c64c681a62a7333b987abbfb42d9345 [2022-07-20 05:47:37,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:47:37,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:47:37,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:47:37,967 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:47:37,967 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:47:37,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/960521-1_1-2.i [2022-07-20 05:47:38,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fd45742/836bad9671054b60846d71f470f7db85/FLAG619612e59 [2022-07-20 05:47:38,400 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:47:38,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/960521-1_1-2.i [2022-07-20 05:47:38,420 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fd45742/836bad9671054b60846d71f470f7db85/FLAG619612e59 [2022-07-20 05:47:38,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2fd45742/836bad9671054b60846d71f470f7db85 [2022-07-20 05:47:38,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:47:38,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:47:38,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:47:38,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:47:38,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:47:38,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:47:38" (1/1) ... [2022-07-20 05:47:38,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c163211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:38, skipping insertion in model container [2022-07-20 05:47:38,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:47:38" (1/1) ... [2022-07-20 05:47:38,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:47:38,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:47:38,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:47:38,692 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:47:38,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:47:38,767 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:47:38,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:38 WrapperNode [2022-07-20 05:47:38,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:47:38,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:47:38,769 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:47:38,770 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:47:38,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:38" (1/1) ... [2022-07-20 05:47:38,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:38" (1/1) ... [2022-07-20 05:47:38,807 INFO L137 Inliner]: procedures = 122, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2022-07-20 05:47:38,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:47:38,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:47:38,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:47:38,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:47:38,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:38" (1/1) ... [2022-07-20 05:47:38,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:38" (1/1) ... [2022-07-20 05:47:38,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:38" (1/1) ... [2022-07-20 05:47:38,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:38" (1/1) ... [2022-07-20 05:47:38,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:38" (1/1) ... [2022-07-20 05:47:38,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:38" (1/1) ... [2022-07-20 05:47:38,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:38" (1/1) ... [2022-07-20 05:47:38,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:47:38,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:47:38,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:47:38,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:47:38,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:38" (1/1) ... [2022-07-20 05:47:38,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:47:38,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:38,863 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-07-20 05:47:38,867 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-07-20 05:47:38,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 05:47:38,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 05:47:38,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:47:38,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:47:38,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:47:38,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 05:47:38,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:47:38,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:47:38,966 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:47:38,967 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:47:39,171 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:47:39,175 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:47:39,175 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 05:47:39,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:47:39 BoogieIcfgContainer [2022-07-20 05:47:39,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:47:39,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:47:39,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:47:39,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:47:39,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:47:38" (1/3) ... [2022-07-20 05:47:39,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5b5ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:47:39, skipping insertion in model container [2022-07-20 05:47:39,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:47:38" (2/3) ... [2022-07-20 05:47:39,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5b5ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:47:39, skipping insertion in model container [2022-07-20 05:47:39,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:47:39" (3/3) ... [2022-07-20 05:47:39,196 INFO L111 eAbstractionObserver]: Analyzing ICFG 960521-1_1-2.i [2022-07-20 05:47:39,205 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:47:39,205 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-07-20 05:47:39,251 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:47:39,257 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5fe65c0b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@67d763c5 [2022-07-20 05:47:39,258 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-07-20 05:47:39,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 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-07-20 05:47:39,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 05:47:39,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:39,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 05:47:39,275 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:39,280 INFO L85 PathProgramCache]: Analyzing trace with hash 28702701, now seen corresponding path program 1 times [2022-07-20 05:47:39,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:39,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412039155] [2022-07-20 05:47:39,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:39,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:39,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:39,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412039155] [2022-07-20 05:47:39,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412039155] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:39,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:39,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:47:39,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170618217] [2022-07-20 05:47:39,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:39,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 05:47:39,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:39,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 05:47:39,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 05:47:39,433 INFO L87 Difference]: Start difference. First operand has 57 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 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-07-20 05:47:39,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:39,443 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2022-07-20 05:47:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 05:47:39,445 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-07-20 05:47:39,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:39,450 INFO L225 Difference]: With dead ends: 57 [2022-07-20 05:47:39,450 INFO L226 Difference]: Without dead ends: 55 [2022-07-20 05:47:39,452 INFO L412 NwaCegarLoop]: 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-07-20 05:47:39,456 INFO L413 NwaCegarLoop]: 60 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, 60 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-07-20 05:47:39,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:47:39,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-20 05:47:39,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-07-20 05:47:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.8125) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 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-07-20 05:47:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2022-07-20 05:47:39,480 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 5 [2022-07-20 05:47:39,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:39,480 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2022-07-20 05:47:39,481 INFO L496 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-07-20 05:47:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2022-07-20 05:47:39,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 05:47:39,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:39,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 05:47:39,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 05:47:39,482 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:39,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:39,483 INFO L85 PathProgramCache]: Analyzing trace with hash 889569384, now seen corresponding path program 1 times [2022-07-20 05:47:39,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:39,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977029294] [2022-07-20 05:47:39,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:39,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:39,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:39,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977029294] [2022-07-20 05:47:39,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977029294] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:39,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:39,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:47:39,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555029427] [2022-07-20 05:47:39,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:39,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:47:39,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:39,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:47:39,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:47:39,540 INFO L87 Difference]: Start difference. First operand 55 states and 58 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-07-20 05:47:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:39,580 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-07-20 05:47:39,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:47:39,581 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-07-20 05:47:39,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:39,581 INFO L225 Difference]: With dead ends: 54 [2022-07-20 05:47:39,582 INFO L226 Difference]: Without dead ends: 54 [2022-07-20 05:47:39,582 INFO L412 NwaCegarLoop]: 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-07-20 05:47:39,584 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:39,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:47:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-20 05:47:39,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-07-20 05:47:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.78125) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 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-07-20 05:47:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-07-20 05:47:39,596 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 6 [2022-07-20 05:47:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:39,596 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-07-20 05:47:39,596 INFO L496 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-07-20 05:47:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-07-20 05:47:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 05:47:39,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:39,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 05:47:39,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 05:47:39,599 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:39,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:39,603 INFO L85 PathProgramCache]: Analyzing trace with hash 889569385, now seen corresponding path program 1 times [2022-07-20 05:47:39,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:39,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710981221] [2022-07-20 05:47:39,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:39,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:39,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:39,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710981221] [2022-07-20 05:47:39,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710981221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:39,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:39,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:47:39,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757581570] [2022-07-20 05:47:39,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:39,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:47:39,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:39,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:47:39,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:47:39,654 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-07-20 05:47:39,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:39,728 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2022-07-20 05:47:39,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:47:39,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-07-20 05:47:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:39,731 INFO L225 Difference]: With dead ends: 105 [2022-07-20 05:47:39,731 INFO L226 Difference]: Without dead ends: 105 [2022-07-20 05:47:39,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:47:39,736 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 52 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:39,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 125 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:47:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-20 05:47:39,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 58. [2022-07-20 05:47:39,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 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-07-20 05:47:39,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-07-20 05:47:39,742 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 6 [2022-07-20 05:47:39,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:39,742 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-07-20 05:47:39,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-07-20 05:47:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-07-20 05:47:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 05:47:39,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:39,743 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:39,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 05:47:39,743 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:39,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:39,743 INFO L85 PathProgramCache]: Analyzing trace with hash 179257870, now seen corresponding path program 1 times [2022-07-20 05:47:39,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:39,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41411968] [2022-07-20 05:47:39,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:39,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:39,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:39,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41411968] [2022-07-20 05:47:39,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41411968] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:39,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436322373] [2022-07-20 05:47:39,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:39,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:39,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:39,815 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:39,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 05:47:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:39,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 05:47:39,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:39,961 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:47:39,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:47:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:39,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:47:39,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436322373] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:39,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 05:47:39,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-07-20 05:47:39,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404180273] [2022-07-20 05:47:39,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:39,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:47:39,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:39,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:47:39,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:47:39,992 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-07-20 05:47:40,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:40,067 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-07-20 05:47:40,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:47:40,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-07-20 05:47:40,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:40,070 INFO L225 Difference]: With dead ends: 104 [2022-07-20 05:47:40,070 INFO L226 Difference]: Without dead ends: 104 [2022-07-20 05:47:40,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:47:40,076 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 104 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:40,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 202 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:47:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-20 05:47:40,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 53. [2022-07-20 05:47:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.75) internal successors, (56), 52 states have internal predecessors, (56), 0 states have call successors, (0), 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-07-20 05:47:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-07-20 05:47:40,086 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 8 [2022-07-20 05:47:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:40,086 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-07-20 05:47:40,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 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-07-20 05:47:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-07-20 05:47:40,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 05:47:40,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:40,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:40,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:40,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:40,315 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:40,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:40,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1213292751, now seen corresponding path program 1 times [2022-07-20 05:47:40,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:40,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612012874] [2022-07-20 05:47:40,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:40,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:40,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:40,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612012874] [2022-07-20 05:47:40,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612012874] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:40,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:40,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:47:40,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917944396] [2022-07-20 05:47:40,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:40,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:47:40,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:40,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:47:40,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:47:40,393 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-07-20 05:47:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:40,417 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-07-20 05:47:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:47:40,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-07-20 05:47:40,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:40,418 INFO L225 Difference]: With dead ends: 50 [2022-07-20 05:47:40,418 INFO L226 Difference]: Without dead ends: 50 [2022-07-20 05:47:40,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:47:40,419 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 59 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:40,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 50 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:47:40,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-20 05:47:40,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-07-20 05:47:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.65625) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 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-07-20 05:47:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-07-20 05:47:40,422 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 9 [2022-07-20 05:47:40,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:40,422 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-07-20 05:47:40,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-07-20 05:47:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-07-20 05:47:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 05:47:40,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:40,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:40,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 05:47:40,423 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:40,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:40,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1213292752, now seen corresponding path program 1 times [2022-07-20 05:47:40,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:40,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30391362] [2022-07-20 05:47:40,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:40,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:40,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:40,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30391362] [2022-07-20 05:47:40,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30391362] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:40,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:40,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:47:40,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379542172] [2022-07-20 05:47:40,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:40,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:47:40,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:40,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:47:40,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:47:40,534 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 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-07-20 05:47:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:40,629 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2022-07-20 05:47:40,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:47:40,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-07-20 05:47:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:40,630 INFO L225 Difference]: With dead ends: 94 [2022-07-20 05:47:40,630 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 05:47:40,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:47:40,632 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 40 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:40,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 193 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:40,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 05:47:40,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2022-07-20 05:47:40,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 50 states have (on average 1.58) internal successors, (79), 67 states have internal predecessors, (79), 0 states have call successors, (0), 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-07-20 05:47:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-07-20 05:47:40,640 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 9 [2022-07-20 05:47:40,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:40,640 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-07-20 05:47:40,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 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-07-20 05:47:40,640 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-07-20 05:47:40,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:47:40,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:40,641 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:40,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 05:47:40,641 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:40,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1626816779, now seen corresponding path program 1 times [2022-07-20 05:47:40,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:40,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038431239] [2022-07-20 05:47:40,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:40,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:40,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:40,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038431239] [2022-07-20 05:47:40,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038431239] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:40,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933567773] [2022-07-20 05:47:40,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:40,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:40,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:40,735 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:40,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 05:47:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:40,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 05:47:40,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:40,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:40,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:47:40,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:47:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:40,837 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:47:40,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933567773] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:40,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 05:47:40,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-07-20 05:47:40,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100383896] [2022-07-20 05:47:40,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:40,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:47:40,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:40,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:47:40,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:47:40,839 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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-07-20 05:47:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:40,915 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2022-07-20 05:47:40,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:47:40,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-07-20 05:47:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:40,916 INFO L225 Difference]: With dead ends: 100 [2022-07-20 05:47:40,916 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 05:47:40,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:47:40,917 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 158 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:40,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 138 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:40,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 05:47:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 63. [2022-07-20 05:47:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 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-07-20 05:47:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-07-20 05:47:40,920 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 11 [2022-07-20 05:47:40,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:40,920 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-07-20 05:47:40,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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-07-20 05:47:40,920 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-07-20 05:47:40,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:47:40,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:40,921 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:40,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:41,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-20 05:47:41,136 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:41,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:41,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1240415274, now seen corresponding path program 1 times [2022-07-20 05:47:41,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:41,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537355402] [2022-07-20 05:47:41,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:41,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:41,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:41,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537355402] [2022-07-20 05:47:41,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537355402] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:41,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437673585] [2022-07-20 05:47:41,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:41,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:41,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:41,173 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:41,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 05:47:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:41,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:47:41,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:41,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:47:41,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437673585] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:41,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 05:47:41,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-07-20 05:47:41,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260206582] [2022-07-20 05:47:41,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:41,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:47:41,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:41,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:47:41,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:47:41,255 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-07-20 05:47:41,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:41,282 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2022-07-20 05:47:41,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:47:41,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-20 05:47:41,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:41,283 INFO L225 Difference]: With dead ends: 93 [2022-07-20 05:47:41,283 INFO L226 Difference]: Without dead ends: 93 [2022-07-20 05:47:41,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:47:41,284 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 37 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:41,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 137 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:47:41,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-20 05:47:41,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 62. [2022-07-20 05:47:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.434782608695652) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 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-07-20 05:47:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-07-20 05:47:41,290 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 12 [2022-07-20 05:47:41,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:41,291 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-07-20 05:47:41,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-07-20 05:47:41,291 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-07-20 05:47:41,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 05:47:41,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:41,292 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:41,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:41,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:41,499 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:41,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:41,499 INFO L85 PathProgramCache]: Analyzing trace with hash 87668155, now seen corresponding path program 1 times [2022-07-20 05:47:41,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:41,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072425828] [2022-07-20 05:47:41,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:41,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:41,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:41,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072425828] [2022-07-20 05:47:41,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072425828] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:41,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145731392] [2022-07-20 05:47:41,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:41,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:41,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:41,612 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:41,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 05:47:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:41,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 05:47:41,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:41,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:41,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:47:41,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:47:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:41,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:41,801 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:41,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145731392] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:47:41,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:47:41,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-07-20 05:47:41,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877541808] [2022-07-20 05:47:41,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:41,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 05:47:41,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:41,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 05:47:41,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-07-20 05:47:41,812 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 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-07-20 05:47:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:42,036 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2022-07-20 05:47:42,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:47:42,036 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 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 14 [2022-07-20 05:47:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:42,037 INFO L225 Difference]: With dead ends: 137 [2022-07-20 05:47:42,037 INFO L226 Difference]: Without dead ends: 137 [2022-07-20 05:47:42,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2022-07-20 05:47:42,037 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 508 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:42,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 247 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:42,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-20 05:47:42,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 65. [2022-07-20 05:47:42,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 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-07-20 05:47:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-07-20 05:47:42,040 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 14 [2022-07-20 05:47:42,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:42,040 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-07-20 05:47:42,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 15 states have internal predecessors, (33), 0 states have call successors, (0), 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-07-20 05:47:42,040 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-07-20 05:47:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:47:42,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:42,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:42,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:42,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:42,241 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:42,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:42,241 INFO L85 PathProgramCache]: Analyzing trace with hash 685561807, now seen corresponding path program 1 times [2022-07-20 05:47:42,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:42,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610332989] [2022-07-20 05:47:42,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:42,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:47:42,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:42,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610332989] [2022-07-20 05:47:42,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610332989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:42,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:42,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:47:42,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096108264] [2022-07-20 05:47:42,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:42,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:47:42,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:42,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:47:42,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:47:42,263 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-07-20 05:47:42,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:42,289 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2022-07-20 05:47:42,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:47:42,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-20 05:47:42,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:42,290 INFO L225 Difference]: With dead ends: 62 [2022-07-20 05:47:42,291 INFO L226 Difference]: Without dead ends: 62 [2022-07-20 05:47:42,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:47:42,291 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 18 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:42,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 71 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:47:42,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-20 05:47:42,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-20 05:47:42,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 49 states have (on average 1.346938775510204) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 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-07-20 05:47:42,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-07-20 05:47:42,293 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 15 [2022-07-20 05:47:42,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:42,294 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-07-20 05:47:42,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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-07-20 05:47:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-07-20 05:47:42,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:47:42,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:42,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:42,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 05:47:42,295 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:42,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:42,295 INFO L85 PathProgramCache]: Analyzing trace with hash 685561808, now seen corresponding path program 1 times [2022-07-20 05:47:42,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:42,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872123634] [2022-07-20 05:47:42,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:42,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:47:42,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:42,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872123634] [2022-07-20 05:47:42,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872123634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:42,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:42,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:47:42,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890851196] [2022-07-20 05:47:42,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:42,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:47:42,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:42,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:47:42,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:47:42,340 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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-07-20 05:47:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:42,379 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2022-07-20 05:47:42,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:47:42,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-20 05:47:42,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:42,380 INFO L225 Difference]: With dead ends: 81 [2022-07-20 05:47:42,380 INFO L226 Difference]: Without dead ends: 81 [2022-07-20 05:47:42,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:47:42,381 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 104 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:42,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 73 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:47:42,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-20 05:47:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 61. [2022-07-20 05:47:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.28) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 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-07-20 05:47:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-07-20 05:47:42,391 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 15 [2022-07-20 05:47:42,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:42,391 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-07-20 05:47:42,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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-07-20 05:47:42,392 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-07-20 05:47:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:47:42,392 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:42,392 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:42,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 05:47:42,392 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:42,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:42,393 INFO L85 PathProgramCache]: Analyzing trace with hash 381862667, now seen corresponding path program 2 times [2022-07-20 05:47:42,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:42,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751659317] [2022-07-20 05:47:42,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:42,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:42,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:42,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751659317] [2022-07-20 05:47:42,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751659317] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:42,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058855515] [2022-07-20 05:47:42,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:47:42,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:42,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:42,443 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:42,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 05:47:42,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:47:42,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:47:42,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:47:42,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:42,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:42,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058855515] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:47:42,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:47:42,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2022-07-20 05:47:42,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515699138] [2022-07-20 05:47:42,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:42,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:47:42,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:42,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:47:42,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:47:42,563 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:42,650 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2022-07-20 05:47:42,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:47:42,651 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 05:47:42,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:42,652 INFO L225 Difference]: With dead ends: 124 [2022-07-20 05:47:42,652 INFO L226 Difference]: Without dead ends: 124 [2022-07-20 05:47:42,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:47:42,652 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 243 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:42,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 240 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:42,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-20 05:47:42,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 78. [2022-07-20 05:47:42,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 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-07-20 05:47:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2022-07-20 05:47:42,655 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 17 [2022-07-20 05:47:42,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:42,655 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2022-07-20 05:47:42,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:42,655 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-07-20 05:47:42,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 05:47:42,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:42,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:42,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:42,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-20 05:47:42,872 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:42,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:42,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1007405378, now seen corresponding path program 1 times [2022-07-20 05:47:42,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:42,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405525028] [2022-07-20 05:47:42,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:42,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:42,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:47:42,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:42,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405525028] [2022-07-20 05:47:42,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405525028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:42,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:42,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:47:42,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184876570] [2022-07-20 05:47:42,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:42,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:47:42,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:42,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:47:42,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:47:42,892 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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-07-20 05:47:42,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:42,899 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-07-20 05:47:42,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:47:42,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-07-20 05:47:42,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:42,900 INFO L225 Difference]: With dead ends: 76 [2022-07-20 05:47:42,900 INFO L226 Difference]: Without dead ends: 76 [2022-07-20 05:47:42,900 INFO L412 NwaCegarLoop]: 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-07-20 05:47:42,901 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:42,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 32 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:47:42,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-20 05:47:42,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-07-20 05:47:42,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.208955223880597) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 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-07-20 05:47:42,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-07-20 05:47:42,903 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 19 [2022-07-20 05:47:42,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:42,903 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-07-20 05:47:42,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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-07-20 05:47:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-07-20 05:47:42,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 05:47:42,904 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:42,904 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:42,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 05:47:42,904 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:42,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:42,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1897750454, now seen corresponding path program 1 times [2022-07-20 05:47:42,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:42,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224268010] [2022-07-20 05:47:42,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:42,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 05:47:42,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:42,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224268010] [2022-07-20 05:47:42,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224268010] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:42,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941829907] [2022-07-20 05:47:42,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:42,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:42,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:42,991 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:42,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 05:47:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:43,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 05:47:43,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:43,066 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:47:43,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:47:43,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 05:47:43,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:47:43,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941829907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:43,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 05:47:43,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2022-07-20 05:47:43,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081097680] [2022-07-20 05:47:43,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:43,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:47:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:43,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:47:43,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:47:43,121 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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-07-20 05:47:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:43,194 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-07-20 05:47:43,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:47:43,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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 19 [2022-07-20 05:47:43,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:43,195 INFO L225 Difference]: With dead ends: 94 [2022-07-20 05:47:43,195 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 05:47:43,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:47:43,196 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 107 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:43,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 104 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:43,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 05:47:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 81. [2022-07-20 05:47:43,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 73 states have (on average 1.178082191780822) internal successors, (86), 80 states have internal predecessors, (86), 0 states have call successors, (0), 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-07-20 05:47:43,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2022-07-20 05:47:43,198 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 19 [2022-07-20 05:47:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:43,198 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2022-07-20 05:47:43,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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-07-20 05:47:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2022-07-20 05:47:43,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 05:47:43,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:43,199 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:43,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:43,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:43,416 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:43,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:43,417 INFO L85 PathProgramCache]: Analyzing trace with hash -951175098, now seen corresponding path program 3 times [2022-07-20 05:47:43,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:43,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481428082] [2022-07-20 05:47:43,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:43,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:43,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:43,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481428082] [2022-07-20 05:47:43,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481428082] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:43,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712998426] [2022-07-20 05:47:43,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:47:43,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:43,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:43,483 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:43,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 05:47:43,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-20 05:47:43,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:47:43,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 05:47:43,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:43,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:43,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:47:43,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:47:43,599 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 05:47:43,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 05:47:43,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712998426] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:47:43,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:47:43,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 16 [2022-07-20 05:47:43,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216756228] [2022-07-20 05:47:43,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:43,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 05:47:43,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:43,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 05:47:43,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:47:43,754 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 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-07-20 05:47:44,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:44,180 INFO L93 Difference]: Finished difference Result 144 states and 147 transitions. [2022-07-20 05:47:44,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:47:44,180 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 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 19 [2022-07-20 05:47:44,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:44,181 INFO L225 Difference]: With dead ends: 144 [2022-07-20 05:47:44,181 INFO L226 Difference]: Without dead ends: 144 [2022-07-20 05:47:44,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=267, Invalid=789, Unknown=0, NotChecked=0, Total=1056 [2022-07-20 05:47:44,182 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 503 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:44,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 218 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:47:44,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-20 05:47:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 79. [2022-07-20 05:47:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.1666666666666667) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 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-07-20 05:47:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-07-20 05:47:44,184 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 19 [2022-07-20 05:47:44,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:44,184 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-07-20 05:47:44,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 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-07-20 05:47:44,184 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-07-20 05:47:44,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 05:47:44,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:44,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:44,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:44,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:44,385 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:44,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:44,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1748930276, now seen corresponding path program 1 times [2022-07-20 05:47:44,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:44,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601061196] [2022-07-20 05:47:44,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:44,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:44,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:47:44,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:44,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601061196] [2022-07-20 05:47:44,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601061196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:44,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:44,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:47:44,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912492544] [2022-07-20 05:47:44,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:44,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:47:44,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:44,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:47:44,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:47:44,422 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-07-20 05:47:44,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:44,437 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2022-07-20 05:47:44,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:47:44,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-07-20 05:47:44,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:44,438 INFO L225 Difference]: With dead ends: 78 [2022-07-20 05:47:44,438 INFO L226 Difference]: Without dead ends: 78 [2022-07-20 05:47:44,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:47:44,438 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 54 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:44,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 60 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:47:44,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-20 05:47:44,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2022-07-20 05:47:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 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-07-20 05:47:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-07-20 05:47:44,441 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 21 [2022-07-20 05:47:44,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:44,441 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-07-20 05:47:44,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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-07-20 05:47:44,441 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-07-20 05:47:44,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 05:47:44,441 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:44,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:44,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 05:47:44,442 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:44,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:44,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1735570006, now seen corresponding path program 1 times [2022-07-20 05:47:44,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:44,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945918668] [2022-07-20 05:47:44,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:44,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:44,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:47:44,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:44,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945918668] [2022-07-20 05:47:44,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945918668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:44,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:44,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:47:44,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947963177] [2022-07-20 05:47:44,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:44,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:47:44,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:44,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:47:44,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:47:44,521 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-07-20 05:47:44,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:44,602 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2022-07-20 05:47:44,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:47:44,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-07-20 05:47:44,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:44,603 INFO L225 Difference]: With dead ends: 85 [2022-07-20 05:47:44,603 INFO L226 Difference]: Without dead ends: 85 [2022-07-20 05:47:44,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:47:44,604 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 36 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:44,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 113 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:47:44,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-20 05:47:44,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 74. [2022-07-20 05:47:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 73 states have internal predecessors, (78), 0 states have call successors, (0), 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-07-20 05:47:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-07-20 05:47:44,606 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 21 [2022-07-20 05:47:44,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:44,606 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-07-20 05:47:44,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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-07-20 05:47:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-07-20 05:47:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 05:47:44,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:44,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:44,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 05:47:44,608 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:44,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:44,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1617736175, now seen corresponding path program 1 times [2022-07-20 05:47:44,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:44,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555712092] [2022-07-20 05:47:44,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:44,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:47:44,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:44,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555712092] [2022-07-20 05:47:44,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555712092] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:44,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:44,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:47:44,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415847985] [2022-07-20 05:47:44,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:44,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:47:44,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:44,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:47:44,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:47:44,650 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:44,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:44,665 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-07-20 05:47:44,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:47:44,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-20 05:47:44,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:44,666 INFO L225 Difference]: With dead ends: 73 [2022-07-20 05:47:44,667 INFO L226 Difference]: Without dead ends: 73 [2022-07-20 05:47:44,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:47:44,667 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:44,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 47 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:47:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-20 05:47:44,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-20 05:47:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 72 states have internal predecessors, (77), 0 states have call successors, (0), 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-07-20 05:47:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 77 transitions. [2022-07-20 05:47:44,670 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 77 transitions. Word has length 22 [2022-07-20 05:47:44,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:44,670 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 77 transitions. [2022-07-20 05:47:44,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:44,670 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-07-20 05:47:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 05:47:44,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:44,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:44,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 05:47:44,672 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:44,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:44,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1389786246, now seen corresponding path program 1 times [2022-07-20 05:47:44,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:44,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756362220] [2022-07-20 05:47:44,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:44,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:44,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:47:44,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:44,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756362220] [2022-07-20 05:47:44,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756362220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:44,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:44,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:47:44,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727122618] [2022-07-20 05:47:44,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:44,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:47:44,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:44,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:47:44,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:47:44,725 INFO L87 Difference]: Start difference. First operand 73 states and 77 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:44,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:44,741 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-07-20 05:47:44,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:47:44,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-20 05:47:44,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:44,742 INFO L225 Difference]: With dead ends: 72 [2022-07-20 05:47:44,742 INFO L226 Difference]: Without dead ends: 72 [2022-07-20 05:47:44,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:47:44,743 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:44,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 41 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:47:44,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-20 05:47:44,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-20 05:47:44,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 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-07-20 05:47:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-07-20 05:47:44,745 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 23 [2022-07-20 05:47:44,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:44,745 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-07-20 05:47:44,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:44,745 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-07-20 05:47:44,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 05:47:44,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:44,746 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:44,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 05:47:44,746 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:44,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:44,746 INFO L85 PathProgramCache]: Analyzing trace with hash 191055246, now seen corresponding path program 1 times [2022-07-20 05:47:44,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:44,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460563878] [2022-07-20 05:47:44,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:44,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:44,831 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 05:47:44,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:44,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460563878] [2022-07-20 05:47:44,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460563878] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:44,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034655334] [2022-07-20 05:47:44,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:44,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:44,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:44,833 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:44,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 05:47:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:44,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:47:44,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 05:47:44,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:45,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2022-07-20 05:47:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 05:47:45,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034655334] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:47:45,089 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:47:45,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-07-20 05:47:45,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786509416] [2022-07-20 05:47:45,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:45,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 05:47:45,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:45,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 05:47:45,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-07-20 05:47:45,091 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 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-07-20 05:47:45,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:45,237 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2022-07-20 05:47:45,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 05:47:45,238 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 05:47:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:45,238 INFO L225 Difference]: With dead ends: 99 [2022-07-20 05:47:45,238 INFO L226 Difference]: Without dead ends: 99 [2022-07-20 05:47:45,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2022-07-20 05:47:45,239 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 247 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:45,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 143 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:45,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-20 05:47:45,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 75. [2022-07-20 05:47:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 74 states have internal predecessors, (79), 0 states have call successors, (0), 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-07-20 05:47:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2022-07-20 05:47:45,241 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 24 [2022-07-20 05:47:45,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:45,241 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2022-07-20 05:47:45,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 16 states have internal predecessors, (49), 0 states have call successors, (0), 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-07-20 05:47:45,241 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-07-20 05:47:45,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 05:47:45,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:45,241 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:45,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:45,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:45,442 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:45,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:45,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1128819910, now seen corresponding path program 1 times [2022-07-20 05:47:45,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:45,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662253235] [2022-07-20 05:47:45,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:45,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:45,480 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:47:45,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:45,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662253235] [2022-07-20 05:47:45,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662253235] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:45,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024087999] [2022-07-20 05:47:45,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:45,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:45,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:45,482 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:45,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 05:47:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:45,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 05:47:45,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:47:45,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:47:45,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024087999] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:47:45,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:47:45,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-07-20 05:47:45,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133638243] [2022-07-20 05:47:45,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:45,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 05:47:45,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:45,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 05:47:45,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:47:45,597 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 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-07-20 05:47:45,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:45,739 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2022-07-20 05:47:45,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 05:47:45,740 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 05:47:45,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:45,740 INFO L225 Difference]: With dead ends: 132 [2022-07-20 05:47:45,740 INFO L226 Difference]: Without dead ends: 132 [2022-07-20 05:47:45,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2022-07-20 05:47:45,741 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 164 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:45,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 302 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-20 05:47:45,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 80. [2022-07-20 05:47:45,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.105263157894737) internal successors, (84), 79 states have internal predecessors, (84), 0 states have call successors, (0), 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-07-20 05:47:45,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-07-20 05:47:45,743 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 24 [2022-07-20 05:47:45,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:45,743 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-07-20 05:47:45,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 0 states have call successors, (0), 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-07-20 05:47:45,743 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-07-20 05:47:45,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 05:47:45,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:45,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:45,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:45,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:45,944 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:45,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:45,944 INFO L85 PathProgramCache]: Analyzing trace with hash -150242775, now seen corresponding path program 1 times [2022-07-20 05:47:45,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:45,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164355393] [2022-07-20 05:47:45,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:45,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:47:46,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:46,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164355393] [2022-07-20 05:47:46,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164355393] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:47:46,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:47:46,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:47:46,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380799739] [2022-07-20 05:47:46,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:47:46,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:47:46,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:46,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:47:46,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:47:46,050 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:46,124 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-07-20 05:47:46,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:47:46,127 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-20 05:47:46,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:46,127 INFO L225 Difference]: With dead ends: 79 [2022-07-20 05:47:46,127 INFO L226 Difference]: Without dead ends: 58 [2022-07-20 05:47:46,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:47:46,128 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 16 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:46,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 70 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:47:46,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-20 05:47:46,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-07-20 05:47:46,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 0 states have call successors, (0), 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-07-20 05:47:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-07-20 05:47:46,129 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 25 [2022-07-20 05:47:46,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:46,129 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-07-20 05:47:46,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:47:46,129 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-07-20 05:47:46,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:47:46,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:46,129 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:46,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 05:47:46,130 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:46,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:46,130 INFO L85 PathProgramCache]: Analyzing trace with hash -119563092, now seen corresponding path program 2 times [2022-07-20 05:47:46,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:46,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44674481] [2022-07-20 05:47:46,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:46,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:46,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 05:47:46,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:46,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44674481] [2022-07-20 05:47:46,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44674481] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:46,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762627089] [2022-07-20 05:47:46,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:47:46,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:46,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:46,233 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:46,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 05:47:46,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:47:46,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:47:46,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 05:47:46,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:46,304 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:47:46,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:47:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-20 05:47:46,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:46,562 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-20 05:47:46,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762627089] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:47:46,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:47:46,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2022-07-20 05:47:46,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807993306] [2022-07-20 05:47:46,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:46,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 05:47:46,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:46,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 05:47:46,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-07-20 05:47:46,564 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 18 states, 17 states have (on average 3.0) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 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-07-20 05:47:46,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:46,800 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2022-07-20 05:47:46,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:47:46,800 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 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 27 [2022-07-20 05:47:46,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:46,801 INFO L225 Difference]: With dead ends: 62 [2022-07-20 05:47:46,801 INFO L226 Difference]: Without dead ends: 62 [2022-07-20 05:47:46,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2022-07-20 05:47:46,802 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 110 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:46,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 106 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:46,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-20 05:47:46,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2022-07-20 05:47:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 0 states have call successors, (0), 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-07-20 05:47:46,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-07-20 05:47:46,803 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 27 [2022-07-20 05:47:46,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:46,804 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-07-20 05:47:46,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.0) internal successors, (51), 18 states have internal predecessors, (51), 0 states have call successors, (0), 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-07-20 05:47:46,804 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-07-20 05:47:46,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 05:47:46,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:46,804 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:46,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:47,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-20 05:47:47,020 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:47,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:47,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1264364278, now seen corresponding path program 1 times [2022-07-20 05:47:47,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:47,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665492031] [2022-07-20 05:47:47,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:47,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:47,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:47,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665492031] [2022-07-20 05:47:47,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665492031] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:47,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811976309] [2022-07-20 05:47:47,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:47,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:47,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:47,393 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:47,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 05:47:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:47,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-20 05:47:47,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:47,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:47:47,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:47:47,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:47:47,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:47:47,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:47:47,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:47,684 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:47,691 INFO L356 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2022-07-20 05:47:47,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 30 [2022-07-20 05:47:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:47:47,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:47,859 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_364 (Array Int Int))) (= (let ((.cse0 (select (store |c_#memory_int| c_~a~0.base v_ArrVal_364) c_~b~0.base))) (+ (select .cse0 (+ c_~b~0.offset (- 4))) (* (- 1) (select (store .cse0 c_~b~0.offset c_~n~0) (+ c_~b~0.offset (* c_~n~0 4) (- 8)))))) 0)) (= c_~b~0.offset 0)) is different from false [2022-07-20 05:47:47,925 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:47,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 40 [2022-07-20 05:47:47,931 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:47,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 66 [2022-07-20 05:47:47,939 INFO L356 Elim1Store]: treesize reduction 10, result has 33.3 percent of original size [2022-07-20 05:47:47,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 44 [2022-07-20 05:47:47,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-20 05:47:47,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:47,961 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:47,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 71 [2022-07-20 05:47:48,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:47:48,090 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-07-20 05:47:48,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811976309] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:47:48,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:47:48,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 32 [2022-07-20 05:47:48,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738371568] [2022-07-20 05:47:48,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:48,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-20 05:47:48,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:48,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-20 05:47:48,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=807, Unknown=1, NotChecked=58, Total=992 [2022-07-20 05:47:48,093 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 32 states, 32 states have (on average 2.3125) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 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-07-20 05:47:48,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:48,689 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-07-20 05:47:48,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 05:47:48,689 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.3125) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 05:47:48,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:48,690 INFO L225 Difference]: With dead ends: 57 [2022-07-20 05:47:48,690 INFO L226 Difference]: Without dead ends: 38 [2022-07-20 05:47:48,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=339, Invalid=1556, Unknown=1, NotChecked=84, Total=1980 [2022-07-20 05:47:48,691 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 66 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:48,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 140 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 267 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-07-20 05:47:48,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-20 05:47:48,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-20 05:47:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 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-07-20 05:47:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-07-20 05:47:48,692 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 29 [2022-07-20 05:47:48,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:48,692 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-07-20 05:47:48,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.3125) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 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-07-20 05:47:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-07-20 05:47:48,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 05:47:48,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:48,692 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:48,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:48,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-20 05:47:48,893 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:48,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:48,893 INFO L85 PathProgramCache]: Analyzing trace with hash 910666860, now seen corresponding path program 2 times [2022-07-20 05:47:48,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:48,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789318113] [2022-07-20 05:47:48,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:48,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:49,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:49,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789318113] [2022-07-20 05:47:49,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789318113] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:49,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916175619] [2022-07-20 05:47:49,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:47:49,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:49,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:49,513 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:49,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 05:47:49,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:47:49,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:47:49,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-20 05:47:49,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:49,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:47:49,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:47:49,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:47:49,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:47:49,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:47:49,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:49,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 05:47:49,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:49,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 05:47:49,927 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-07-20 05:47:49,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 26 [2022-07-20 05:47:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 05:47:49,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:50,168 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int)) (= (let ((.cse0 (select (store |c_#memory_int| c_~a~0.base v_ArrVal_408) c_~b~0.base))) (+ (select .cse0 (+ c_~b~0.offset (- 4))) (* (- 1) (select (store (store .cse0 c_~b~0.offset v_ArrVal_409) (+ c_~b~0.offset 4) c_~n~0) (+ c_~b~0.offset (* c_~n~0 4) (- 8)))))) 0)) is different from false [2022-07-20 05:47:50,200 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:50,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 45 [2022-07-20 05:47:50,213 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:50,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 76 [2022-07-20 05:47:50,223 INFO L356 Elim1Store]: treesize reduction 10, result has 33.3 percent of original size [2022-07-20 05:47:50,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 218 [2022-07-20 05:47:50,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-20 05:47:50,308 INFO L356 Elim1Store]: treesize reduction 14, result has 64.1 percent of original size [2022-07-20 05:47:50,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 270 treesize of output 246 [2022-07-20 05:47:50,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:47:50,496 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 5 not checked. [2022-07-20 05:47:50,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916175619] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:47:50,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:47:50,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 14] total 40 [2022-07-20 05:47:50,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669592822] [2022-07-20 05:47:50,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:50,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-20 05:47:50,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:50,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-20 05:47:50,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1337, Unknown=1, NotChecked=74, Total=1560 [2022-07-20 05:47:50,498 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 40 states, 40 states have (on average 2.15) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 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-07-20 05:47:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:51,681 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2022-07-20 05:47:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:47:51,682 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.15) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 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 37 [2022-07-20 05:47:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:51,682 INFO L225 Difference]: With dead ends: 65 [2022-07-20 05:47:51,682 INFO L226 Difference]: Without dead ends: 40 [2022-07-20 05:47:51,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=450, Invalid=2856, Unknown=4, NotChecked=112, Total=3422 [2022-07-20 05:47:51,683 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 125 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:51,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 196 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 371 Invalid, 0 Unknown, 62 Unchecked, 0.2s Time] [2022-07-20 05:47:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-20 05:47:51,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-07-20 05:47:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 0 states have call successors, (0), 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-07-20 05:47:51,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-07-20 05:47:51,685 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 37 [2022-07-20 05:47:51,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:51,685 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-07-20 05:47:51,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.15) internal successors, (86), 40 states have internal predecessors, (86), 0 states have call successors, (0), 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-07-20 05:47:51,685 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-07-20 05:47:51,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 05:47:51,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:51,685 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:51,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:51,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-20 05:47:51,905 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:51,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash 46609959, now seen corresponding path program 3 times [2022-07-20 05:47:51,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:51,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735080581] [2022-07-20 05:47:51,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:51,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:51,954 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 05:47:51,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:51,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735080581] [2022-07-20 05:47:51,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735080581] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:51,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973302097] [2022-07-20 05:47:51,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:47:51,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:51,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:51,956 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:51,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-20 05:47:52,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 05:47:52,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:47:52,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 05:47:52,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:52,114 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 05:47:52,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:52,170 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-20 05:47:52,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973302097] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:47:52,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:47:52,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 19 [2022-07-20 05:47:52,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913797021] [2022-07-20 05:47:52,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:52,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 05:47:52,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:52,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 05:47:52,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2022-07-20 05:47:52,171 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 0 states have call successors, (0), 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-07-20 05:47:52,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:52,238 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-07-20 05:47:52,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:47:52,238 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 0 states have call successors, (0), 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 39 [2022-07-20 05:47:52,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:52,238 INFO L225 Difference]: With dead ends: 48 [2022-07-20 05:47:52,239 INFO L226 Difference]: Without dead ends: 48 [2022-07-20 05:47:52,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2022-07-20 05:47:52,239 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 74 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:52,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 86 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:52,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-20 05:47:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-07-20 05:47:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 45 states have internal predecessors, (48), 0 states have call successors, (0), 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-07-20 05:47:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-07-20 05:47:52,240 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 39 [2022-07-20 05:47:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:52,240 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-07-20 05:47:52,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 19 states have internal predecessors, (67), 0 states have call successors, (0), 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-07-20 05:47:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-07-20 05:47:52,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 05:47:52,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:52,241 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:52,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:52,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-20 05:47:52,451 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:52,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:52,452 INFO L85 PathProgramCache]: Analyzing trace with hash 621039308, now seen corresponding path program 4 times [2022-07-20 05:47:52,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:52,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558272733] [2022-07-20 05:47:52,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:52,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:53,032 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:53,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:53,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558272733] [2022-07-20 05:47:53,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558272733] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:53,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777368942] [2022-07-20 05:47:53,033 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:47:53,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:53,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:53,034 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:53,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 05:47:53,089 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:47:53,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:47:53,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-20 05:47:53,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:53,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:47:53,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:47:53,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:47:53,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:47:53,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:47:53,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:47:53,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:53,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 05:47:53,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:53,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 05:47:53,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:53,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 05:47:53,586 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-07-20 05:47:53,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 26 [2022-07-20 05:47:53,608 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 05:47:53,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:54,401 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:54,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 50 [2022-07-20 05:47:54,407 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:54,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 99 [2022-07-20 05:47:54,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:54,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:47:54,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:54,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-20 05:47:54,436 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-20 05:47:54,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2476 treesize of output 2148 [2022-07-20 05:47:54,566 INFO L356 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2022-07-20 05:47:54,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 646 treesize of output 511 [2022-07-20 05:47:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 05:47:54,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777368942] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:47:54,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:47:54,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 20] total 56 [2022-07-20 05:47:54,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544391249] [2022-07-20 05:47:54,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:54,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-07-20 05:47:54,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:54,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-07-20 05:47:54,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=2804, Unknown=3, NotChecked=0, Total=3080 [2022-07-20 05:47:54,631 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 56 states have internal predecessors, (111), 0 states have call successors, (0), 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-07-20 05:47:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:56,657 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2022-07-20 05:47:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-20 05:47:56,657 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 56 states have internal predecessors, (111), 0 states have call successors, (0), 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 45 [2022-07-20 05:47:56,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:56,657 INFO L225 Difference]: With dead ends: 90 [2022-07-20 05:47:56,658 INFO L226 Difference]: Without dead ends: 75 [2022-07-20 05:47:56,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 70 SyntacticMatches, 12 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2012 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=945, Invalid=6024, Unknown=3, NotChecked=0, Total=6972 [2022-07-20 05:47:56,659 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 427 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 393 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:56,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 158 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 788 Invalid, 0 Unknown, 393 Unchecked, 0.4s Time] [2022-07-20 05:47:56,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-20 05:47:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 49. [2022-07-20 05:47:56,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 0 states have call successors, (0), 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-07-20 05:47:56,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2022-07-20 05:47:56,661 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 45 [2022-07-20 05:47:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:56,661 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2022-07-20 05:47:56,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 56 states have internal predecessors, (111), 0 states have call successors, (0), 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-07-20 05:47:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-07-20 05:47:56,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 05:47:56,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:56,662 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:56,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:56,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:56,879 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:56,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:56,879 INFO L85 PathProgramCache]: Analyzing trace with hash 440238160, now seen corresponding path program 5 times [2022-07-20 05:47:56,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:56,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304335014] [2022-07-20 05:47:56,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:56,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 05:47:56,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:56,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304335014] [2022-07-20 05:47:56,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304335014] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:56,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74003341] [2022-07-20 05:47:56,944 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:47:56,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:56,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:56,945 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:56,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-20 05:47:57,032 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-20 05:47:57,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:47:57,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-20 05:47:57,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 35 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 05:47:57,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 35 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 05:47:57,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74003341] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:47:57,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:47:57,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2022-07-20 05:47:57,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420164758] [2022-07-20 05:47:57,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:57,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 05:47:57,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:57,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 05:47:57,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-07-20 05:47:57,146 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 0 states have call successors, (0), 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-07-20 05:47:57,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:57,203 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2022-07-20 05:47:57,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 05:47:57,203 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 0 states have call successors, (0), 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 48 [2022-07-20 05:47:57,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:57,204 INFO L225 Difference]: With dead ends: 67 [2022-07-20 05:47:57,204 INFO L226 Difference]: Without dead ends: 51 [2022-07-20 05:47:57,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-07-20 05:47:57,204 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:57,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 62 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-20 05:47:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-20 05:47:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 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-07-20 05:47:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-07-20 05:47:57,206 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 48 [2022-07-20 05:47:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:57,206 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-07-20 05:47:57,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 18 states have internal predecessors, (63), 0 states have call successors, (0), 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-07-20 05:47:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-07-20 05:47:57,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 05:47:57,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:57,207 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:57,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:57,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-20 05:47:57,423 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:57,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:57,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2002639947, now seen corresponding path program 6 times [2022-07-20 05:47:57,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:57,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852640210] [2022-07-20 05:47:57,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:57,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:57,476 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-20 05:47:57,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:57,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852640210] [2022-07-20 05:47:57,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852640210] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:57,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212819270] [2022-07-20 05:47:57,477 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:47:57,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:57,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:57,479 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:57,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-20 05:47:57,560 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-20 05:47:57,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:47:57,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 05:47:57,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-20 05:47:57,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-20 05:47:57,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212819270] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:47:57,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:47:57,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 21 [2022-07-20 05:47:57,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876356402] [2022-07-20 05:47:57,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:47:57,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 05:47:57,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:47:57,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 05:47:57,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-07-20 05:47:57,707 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 0 states have call successors, (0), 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-07-20 05:47:57,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:47:57,826 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-07-20 05:47:57,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:47:57,826 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 0 states have call successors, (0), 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 50 [2022-07-20 05:47:57,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:47:57,826 INFO L225 Difference]: With dead ends: 56 [2022-07-20 05:47:57,826 INFO L226 Difference]: Without dead ends: 56 [2022-07-20 05:47:57,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2022-07-20 05:47:57,827 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 131 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:47:57,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 90 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:47:57,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-20 05:47:57,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2022-07-20 05:47:57,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 53 states have internal predecessors, (56), 0 states have call successors, (0), 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-07-20 05:47:57,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-07-20 05:47:57,829 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 50 [2022-07-20 05:47:57,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:47:57,829 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-07-20 05:47:57,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 0 states have call successors, (0), 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-07-20 05:47:57,829 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-07-20 05:47:57,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-20 05:47:57,829 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:47:57,830 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:47:57,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-20 05:47:58,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-20 05:47:58,047 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:47:58,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:47:58,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1468723586, now seen corresponding path program 7 times [2022-07-20 05:47:58,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:47:58,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126253762] [2022-07-20 05:47:58,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:47:58,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:47:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:47:58,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:47:58,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126253762] [2022-07-20 05:47:58,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126253762] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:47:58,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217936648] [2022-07-20 05:47:58,817 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:47:58,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:47:58,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:47:58,819 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:47:58,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-20 05:47:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:47:58,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-20 05:47:58,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:47:58,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:47:58,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:47:59,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:47:59,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:47:59,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:47:59,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:47:59,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:47:59,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:59,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 05:47:59,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:59,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 05:47:59,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:59,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 05:47:59,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:47:59,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 05:47:59,382 INFO L356 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-07-20 05:47:59,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 23 [2022-07-20 05:47:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-20 05:47:59,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:47:59,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 Int) (v_ArrVal_663 (Array Int Int)) (v_ArrVal_668 Int) (v_ArrVal_667 Int)) (= (let ((.cse0 (select (store |c_#memory_int| c_~a~0.base v_ArrVal_663) c_~b~0.base))) (+ (* (select (store (store (store (store .cse0 c_~b~0.offset v_ArrVal_665) (+ c_~b~0.offset 4) v_ArrVal_667) (+ c_~b~0.offset 8) v_ArrVal_668) (+ c_~b~0.offset 12) c_~n~0) (+ c_~b~0.offset (* c_~n~0 4) (- 8))) (- 1)) (select .cse0 (+ c_~b~0.offset (- 4))))) 0)) is different from false [2022-07-20 05:47:59,871 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:59,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 55 [2022-07-20 05:47:59,876 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:47:59,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 96 [2022-07-20 05:47:59,892 INFO L356 Elim1Store]: treesize reduction 10, result has 33.3 percent of original size [2022-07-20 05:47:59,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8796 treesize of output 7666 [2022-07-20 05:48:00,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-20 05:48:00,940 INFO L356 Elim1Store]: treesize reduction 14, result has 64.1 percent of original size [2022-07-20 05:48:00,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2228 treesize of output 1966 [2022-07-20 05:48:01,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:48:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 9 not checked. [2022-07-20 05:48:01,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217936648] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:48:01,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:48:01,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 17, 20] total 59 [2022-07-20 05:48:01,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761296607] [2022-07-20 05:48:01,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:48:01,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-20 05:48:01,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:48:01,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-20 05:48:01,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=3027, Unknown=1, NotChecked=112, Total=3422 [2022-07-20 05:48:01,488 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 59 states, 59 states have (on average 2.152542372881356) internal successors, (127), 59 states have internal predecessors, (127), 0 states have call successors, (0), 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-07-20 05:48:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:04,565 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2022-07-20 05:48:04,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-07-20 05:48:04,566 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.152542372881356) internal successors, (127), 59 states have internal predecessors, (127), 0 states have call successors, (0), 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 53 [2022-07-20 05:48:04,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:04,566 INFO L225 Difference]: With dead ends: 149 [2022-07-20 05:48:04,566 INFO L226 Difference]: Without dead ends: 102 [2022-07-20 05:48:04,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 88 SyntacticMatches, 12 SemanticMatches, 108 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4191 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1180, Invalid=10595, Unknown=1, NotChecked=214, Total=11990 [2022-07-20 05:48:04,569 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 231 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 386 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:04,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 284 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 799 Invalid, 0 Unknown, 386 Unchecked, 0.3s Time] [2022-07-20 05:48:04,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-20 05:48:04,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 91. [2022-07-20 05:48:04,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.0555555555555556) internal successors, (95), 90 states have internal predecessors, (95), 0 states have call successors, (0), 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-07-20 05:48:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2022-07-20 05:48:04,571 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 53 [2022-07-20 05:48:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:04,571 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2022-07-20 05:48:04,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.152542372881356) internal successors, (127), 59 states have internal predecessors, (127), 0 states have call successors, (0), 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-07-20 05:48:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2022-07-20 05:48:04,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 05:48:04,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:04,572 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:48:04,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-20 05:48:04,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:04,777 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:48:04,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:04,777 INFO L85 PathProgramCache]: Analyzing trace with hash 435004733, now seen corresponding path program 8 times [2022-07-20 05:48:04,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:48:04,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035910217] [2022-07-20 05:48:04,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:04,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:48:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 20 proven. 45 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-20 05:48:04,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:48:04,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035910217] [2022-07-20 05:48:04,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035910217] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:04,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235241808] [2022-07-20 05:48:04,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:48:04,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:04,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:04,867 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:48:04,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-20 05:48:04,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:48:04,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:48:04,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 05:48:04,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:05,041 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 30 proven. 35 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-20 05:48:05,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:48:05,095 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 30 proven. 35 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-20 05:48:05,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235241808] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:48:05,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:48:05,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2022-07-20 05:48:05,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116346281] [2022-07-20 05:48:05,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:48:05,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 05:48:05,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:48:05,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 05:48:05,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=300, Unknown=0, NotChecked=0, Total=462 [2022-07-20 05:48:05,098 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 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-07-20 05:48:05,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:48:05,262 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2022-07-20 05:48:05,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:48:05,263 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 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 55 [2022-07-20 05:48:05,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:48:05,263 INFO L225 Difference]: With dead ends: 135 [2022-07-20 05:48:05,263 INFO L226 Difference]: Without dead ends: 135 [2022-07-20 05:48:05,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=304, Invalid=566, Unknown=0, NotChecked=0, Total=870 [2022-07-20 05:48:05,264 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 228 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:48:05,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 79 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:48:05,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-20 05:48:05,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2022-07-20 05:48:05,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 0 states have call successors, (0), 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-07-20 05:48:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-07-20 05:48:05,266 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 55 [2022-07-20 05:48:05,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:48:05,266 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-07-20 05:48:05,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 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-07-20 05:48:05,266 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-07-20 05:48:05,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-20 05:48:05,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:48:05,267 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:48:05,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-20 05:48:05,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:05,477 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:48:05,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:48:05,478 INFO L85 PathProgramCache]: Analyzing trace with hash 692243874, now seen corresponding path program 9 times [2022-07-20 05:48:05,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:48:05,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082139159] [2022-07-20 05:48:05,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:48:05,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:48:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:48:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:48:06,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:48:06,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082139159] [2022-07-20 05:48:06,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082139159] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:48:06,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468795334] [2022-07-20 05:48:06,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:48:06,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:48:06,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:48:06,287 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:48:06,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-20 05:48:06,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-20 05:48:06,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:48:06,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-20 05:48:06,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:48:06,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:48:06,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:48:06,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:48:06,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:48:06,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:48:06,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:48:06,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:48:06,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:48:06,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:06,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 05:48:06,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:48:06,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 05:48:06,891 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-20 05:48:06,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-07-20 05:48:06,987 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-20 05:48:06,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 40 [2022-07-20 05:48:07,120 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-20 05:48:07,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 40 [2022-07-20 05:48:07,413 INFO L356 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2022-07-20 05:48:07,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 33 [2022-07-20 05:48:07,437 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 31 proven. 45 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-20 05:48:07,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:49:02,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~i~0#1_153| Int) (v_ArrVal_796 Int) (|v_ULTIMATE.start_foo_~i~0#1_154| Int) (v_ArrVal_801 Int) (|v_ULTIMATE.start_foo_~i~0#1_156| Int) (v_ArrVal_799 Int)) (or (not (<= |v_ULTIMATE.start_foo_~i~0#1_154| (+ |v_ULTIMATE.start_foo_~i~0#1_156| 1))) (not (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 1) c_~n~0)) (= (let ((.cse0 (store (store (store (store (select |c_#memory_int| c_~b~0.base) (+ c_~b~0.offset (* |c_ULTIMATE.start_foo_~i~0#1| 4)) v_ArrVal_796) (+ (* |v_ULTIMATE.start_foo_~i~0#1_156| 4) c_~b~0.offset) v_ArrVal_799) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_154| 4)) v_ArrVal_801) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_153| 4)) c_~n~0))) (+ (* (- 1) (select .cse0 (+ c_~b~0.offset (* c_~n~0 4) (- 8)))) (select .cse0 (+ c_~b~0.offset (- 4))))) 0) (not (<= |v_ULTIMATE.start_foo_~i~0#1_153| (+ |v_ULTIMATE.start_foo_~i~0#1_154| 1))) (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 2) c_~n~0))) is different from false [2022-07-20 05:49:04,970 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_foo_~i~0#1_157| Int)) (or (not (<= (+ |c_ULTIMATE.start_foo_~i~0#1| 1) |v_ULTIMATE.start_foo_~i~0#1_157|)) (forall ((|v_ULTIMATE.start_foo_~i~0#1_153| Int) (v_ArrVal_796 Int) (|v_ULTIMATE.start_foo_~i~0#1_154| Int) (v_ArrVal_801 Int) (|v_ULTIMATE.start_foo_~i~0#1_156| Int) (v_ArrVal_799 Int)) (or (not (<= |v_ULTIMATE.start_foo_~i~0#1_154| (+ |v_ULTIMATE.start_foo_~i~0#1_156| 1))) (not (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 1) c_~n~0)) (not (<= |v_ULTIMATE.start_foo_~i~0#1_153| (+ |v_ULTIMATE.start_foo_~i~0#1_154| 1))) (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 2) c_~n~0) (= (let ((.cse0 (store (store (store (store (select |c_#memory_int| c_~b~0.base) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_157| 4)) v_ArrVal_796) (+ (* |v_ULTIMATE.start_foo_~i~0#1_156| 4) c_~b~0.offset) v_ArrVal_799) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_154| 4)) v_ArrVal_801) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_153| 4)) c_~n~0))) (+ (select .cse0 (+ c_~b~0.offset (- 4))) (* (- 1) (select .cse0 (+ c_~b~0.offset (* c_~n~0 4) (- 8)))))) 0))))) is different from false [2022-07-20 05:50:16,952 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:16,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 107 [2022-07-20 05:50:16,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:16,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 200 [2022-07-20 05:50:16,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:50:16,968 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:50:16,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:50:16,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:50:16,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2022-07-20 05:50:17,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-20 05:50:17,028 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:50:17,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:50:17,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:50:17,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:50:17,044 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:50:17,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 118 [2022-07-20 05:50:17,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:50:19,453 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 20 proven. 43 refuted. 0 times theorem prover too weak. 40 trivial. 13 not checked. [2022-07-20 05:50:19,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468795334] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:50:19,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:50:19,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 26] total 69 [2022-07-20 05:50:19,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288250018] [2022-07-20 05:50:19,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:50:19,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-20 05:50:19,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:50:19,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-20 05:50:19,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=3803, Unknown=63, NotChecked=262, Total=4692 [2022-07-20 05:50:19,455 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 69 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 69 states have internal predecessors, (142), 0 states have call successors, (0), 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-07-20 05:50:22,033 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_foo_~i~0#1_153| Int) (v_ArrVal_796 Int) (v_ArrVal_794 Int) (|v_ULTIMATE.start_foo_~i~0#1_154| Int) (v_ArrVal_793 (Array Int Int)) (|v_ULTIMATE.start_foo_~i~0#1_157| Int) (v_ArrVal_801 Int) (|v_ULTIMATE.start_foo_~i~0#1_156| Int) (v_ArrVal_799 Int) (|v_ULTIMATE.start_foo_~i~0#1_158| Int)) (let ((.cse0 (+ |v_ULTIMATE.start_foo_~i~0#1_158| 1))) (or (not (<= |v_ULTIMATE.start_foo_~i~0#1_154| (+ |v_ULTIMATE.start_foo_~i~0#1_156| 1))) (not (< .cse0 c_~n~0)) (not (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 1) c_~n~0)) (not (<= 0 |v_ULTIMATE.start_foo_~i~0#1_158|)) (not (<= .cse0 |v_ULTIMATE.start_foo_~i~0#1_157|)) (= (let ((.cse1 (store (store (store (store (store (select (store |c_#memory_int| c_~a~0.base v_ArrVal_793) c_~b~0.base) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_158| 4)) v_ArrVal_794) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_157| 4)) v_ArrVal_796) (+ (* |v_ULTIMATE.start_foo_~i~0#1_156| 4) c_~b~0.offset) v_ArrVal_799) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_154| 4)) v_ArrVal_801) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_153| 4)) c_~n~0))) (+ (* (- 1) (select .cse1 (+ c_~b~0.offset (* c_~n~0 4) (- 8)))) (select .cse1 (+ c_~b~0.offset (- 4))))) 0) (not (<= |v_ULTIMATE.start_foo_~i~0#1_153| (+ |v_ULTIMATE.start_foo_~i~0#1_154| 1))) (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 2) c_~n~0)))) (or (= (let ((.cse2 (store (select |c_#memory_int| c_~b~0.base) (+ c_~b~0.offset (* |c_ULTIMATE.start_foo_~i~0#1| 4)) c_~n~0))) (+ (select .cse2 (+ c_~b~0.offset (- 4))) (* (- 1) (select .cse2 (+ c_~b~0.offset (* c_~n~0 4) (- 8)))))) 0) (not (< (+ |c_ULTIMATE.start_foo_~i~0#1| 1) c_~n~0)) (< (+ 2 |c_ULTIMATE.start_foo_~i~0#1|) c_~n~0)) (or (<= c_~n~0 1) (and (not (= c_~b~0.base c_~a~0.base)) (< 3 c_~n~0) (= c_~b~0.offset (+ |c_ULTIMATE.start_main_#t~post9#1.offset| 4)) (= c_~b~0.base |c_ULTIMATE.start_main_#t~post9#1.base|))) (<= c_~n~0 5) (<= 5 c_~n~0)) is different from false [2022-07-20 05:52:09,305 WARN L233 SmtUtils]: Spent 12.55s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 05:52:11,355 WARN L833 $PredicateComparison]: unable to prove that (and (or (< (+ 2 |c_ULTIMATE.start_foo_~i~0#1|) c_~n~0) (= (let ((.cse0 (select |c_#memory_int| c_~b~0.base))) (+ (* (- 1) (select .cse0 (+ c_~b~0.offset (* c_~n~0 4) (- 8)))) (select .cse0 (+ c_~b~0.offset (- 4))))) 0)) (forall ((|v_ULTIMATE.start_foo_~i~0#1_157| Int)) (or (not (<= (+ |c_ULTIMATE.start_foo_~i~0#1| 1) |v_ULTIMATE.start_foo_~i~0#1_157|)) (forall ((|v_ULTIMATE.start_foo_~i~0#1_153| Int) (v_ArrVal_796 Int) (|v_ULTIMATE.start_foo_~i~0#1_154| Int) (v_ArrVal_801 Int) (|v_ULTIMATE.start_foo_~i~0#1_156| Int) (v_ArrVal_799 Int)) (or (not (<= |v_ULTIMATE.start_foo_~i~0#1_154| (+ |v_ULTIMATE.start_foo_~i~0#1_156| 1))) (not (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 1) c_~n~0)) (not (<= |v_ULTIMATE.start_foo_~i~0#1_153| (+ |v_ULTIMATE.start_foo_~i~0#1_154| 1))) (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 2) c_~n~0) (= (let ((.cse1 (store (store (store (store (select |c_#memory_int| c_~b~0.base) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_157| 4)) v_ArrVal_796) (+ (* |v_ULTIMATE.start_foo_~i~0#1_156| 4) c_~b~0.offset) v_ArrVal_799) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_154| 4)) v_ArrVal_801) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_153| 4)) c_~n~0))) (+ (select .cse1 (+ c_~b~0.offset (- 4))) (* (- 1) (select .cse1 (+ c_~b~0.offset (* c_~n~0 4) (- 8)))))) 0))))) (forall ((|v_ULTIMATE.start_foo_~i~0#1_153| Int)) (or (not (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 1) c_~n~0)) (= (let ((.cse2 (store (select |c_#memory_int| c_~b~0.base) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_153| 4)) c_~n~0))) (+ (select .cse2 (+ c_~b~0.offset (- 4))) (* (- 1) (select .cse2 (+ c_~b~0.offset (* c_~n~0 4) (- 8)))))) 0) (not (<= |v_ULTIMATE.start_foo_~i~0#1_153| (+ |c_ULTIMATE.start_foo_~i~0#1| 1))) (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 2) c_~n~0)))) is different from false [2022-07-20 05:52:12,388 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~b~0.offset (- 4))) (.cse3 (+ c_~b~0.offset (* c_~n~0 4) (- 8))) (.cse2 (select |c_#memory_int| c_~b~0.base)) (.cse1 (< (+ |c_ULTIMATE.start_foo_~i~0#1| 1) c_~n~0))) (and (forall ((|v_ULTIMATE.start_foo_~i~0#1_153| Int) (v_ArrVal_796 Int) (|v_ULTIMATE.start_foo_~i~0#1_154| Int) (v_ArrVal_801 Int) (|v_ULTIMATE.start_foo_~i~0#1_156| Int) (v_ArrVal_799 Int)) (or (not (<= |v_ULTIMATE.start_foo_~i~0#1_154| (+ |v_ULTIMATE.start_foo_~i~0#1_156| 1))) (not (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 1) c_~n~0)) (= (let ((.cse0 (store (store (store (store (select |c_#memory_int| c_~b~0.base) (+ c_~b~0.offset (* |c_ULTIMATE.start_foo_~i~0#1| 4)) v_ArrVal_796) (+ (* |v_ULTIMATE.start_foo_~i~0#1_156| 4) c_~b~0.offset) v_ArrVal_799) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_154| 4)) v_ArrVal_801) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_153| 4)) c_~n~0))) (+ (* (- 1) (select .cse0 (+ c_~b~0.offset (* c_~n~0 4) (- 8)))) (select .cse0 (+ c_~b~0.offset (- 4))))) 0) (not (<= |v_ULTIMATE.start_foo_~i~0#1_153| (+ |v_ULTIMATE.start_foo_~i~0#1_154| 1))) (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 2) c_~n~0))) (or .cse1 (= (+ (* (- 1) (select .cse2 .cse3)) (select .cse2 .cse4)) 0)) (or (= (let ((.cse5 (store .cse2 (+ c_~b~0.offset (* |c_ULTIMATE.start_foo_~i~0#1| 4)) c_~n~0))) (+ (select .cse5 .cse4) (* (- 1) (select .cse5 .cse3)))) 0) (not .cse1) (< (+ 2 |c_ULTIMATE.start_foo_~i~0#1|) c_~n~0)))) is different from false [2022-07-20 05:52:13,406 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_foo_~i~0#1_153| Int) (v_ArrVal_796 Int) (|v_ULTIMATE.start_foo_~i~0#1_154| Int) (v_ArrVal_801 Int) (|v_ULTIMATE.start_foo_~i~0#1_156| Int) (v_ArrVal_799 Int)) (or (not (<= |v_ULTIMATE.start_foo_~i~0#1_154| (+ |v_ULTIMATE.start_foo_~i~0#1_156| 1))) (not (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 1) c_~n~0)) (= (let ((.cse0 (store (store (store (store (select |c_#memory_int| c_~b~0.base) (+ c_~b~0.offset (* |c_ULTIMATE.start_foo_~i~0#1| 4)) v_ArrVal_796) (+ (* |v_ULTIMATE.start_foo_~i~0#1_156| 4) c_~b~0.offset) v_ArrVal_799) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_154| 4)) v_ArrVal_801) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_153| 4)) c_~n~0))) (+ (* (- 1) (select .cse0 (+ c_~b~0.offset (* c_~n~0 4) (- 8)))) (select .cse0 (+ c_~b~0.offset (- 4))))) 0) (not (<= |v_ULTIMATE.start_foo_~i~0#1_153| (+ |v_ULTIMATE.start_foo_~i~0#1_154| 1))) (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 2) c_~n~0))) (or (= (let ((.cse1 (store (select |c_#memory_int| c_~b~0.base) (+ c_~b~0.offset (* |c_ULTIMATE.start_foo_~i~0#1| 4)) c_~n~0))) (+ (select .cse1 (+ c_~b~0.offset (- 4))) (* (- 1) (select .cse1 (+ c_~b~0.offset (* c_~n~0 4) (- 8)))))) 0) (< (+ 2 |c_ULTIMATE.start_foo_~i~0#1|) c_~n~0))) is different from false [2022-07-20 05:52:15,410 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~b~0.base))) (let ((.cse2 (= c_~n~0 (select .cse1 0)))) (and (let ((.cse0 (+ c_~b~0.offset (- 4)))) (or (not (= .cse0 0)) (= c_~n~0 (select .cse1 .cse0)))) (= c_~a~0.offset 0) (= c_~b~0.offset 4) (or (< c_~b~0.offset 4) (= (+ c_~a~0.offset 24) (* c_~n~0 4))) .cse2 (<= 6 c_~n~0) (<= 0 |c_ULTIMATE.start_foo_~i~0#1|) (= |c_ULTIMATE.start_foo_~i~0#1| 0) (<= c_~b~0.offset 4) (forall ((|v_ULTIMATE.start_foo_~i~0#1_157| Int)) (or (not (<= (+ |c_ULTIMATE.start_foo_~i~0#1| 1) |v_ULTIMATE.start_foo_~i~0#1_157|)) (forall ((|v_ULTIMATE.start_foo_~i~0#1_153| Int) (v_ArrVal_796 Int) (|v_ULTIMATE.start_foo_~i~0#1_154| Int) (v_ArrVal_801 Int) (|v_ULTIMATE.start_foo_~i~0#1_156| Int) (v_ArrVal_799 Int)) (or (not (<= |v_ULTIMATE.start_foo_~i~0#1_154| (+ |v_ULTIMATE.start_foo_~i~0#1_156| 1))) (not (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 1) c_~n~0)) (not (<= |v_ULTIMATE.start_foo_~i~0#1_153| (+ |v_ULTIMATE.start_foo_~i~0#1_154| 1))) (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 2) c_~n~0) (= (let ((.cse3 (store (store (store (store (select |c_#memory_int| c_~b~0.base) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_157| 4)) v_ArrVal_796) (+ (* |v_ULTIMATE.start_foo_~i~0#1_156| 4) c_~b~0.offset) v_ArrVal_799) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_154| 4)) v_ArrVal_801) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_153| 4)) c_~n~0))) (+ (select .cse3 (+ c_~b~0.offset (- 4))) (* (- 1) (select .cse3 (+ c_~b~0.offset (* c_~n~0 4) (- 8)))))) 0))))) (or .cse2 (<= |c_ULTIMATE.start_foo_~i~0#1| (+ 2 (div (* (- 1) c_~b~0.offset) 4)))) (< (+ |c_ULTIMATE.start_foo_~i~0#1| 1) c_~n~0) (= (select .cse1 (+ c_~b~0.offset (* |c_ULTIMATE.start_foo_~i~0#1| 4))) c_~n~0)))) is different from false [2022-07-20 05:52:17,426 WARN L833 $PredicateComparison]: unable to prove that (and (or (< (+ 2 |c_ULTIMATE.start_foo_~i~0#1|) c_~n~0) (= (let ((.cse0 (select |c_#memory_int| c_~b~0.base))) (+ (* (- 1) (select .cse0 (+ c_~b~0.offset (* c_~n~0 4) (- 8)))) (select .cse0 (+ c_~b~0.offset (- 4))))) 0)) (forall ((|v_ULTIMATE.start_foo_~i~0#1_153| Int) (|v_ULTIMATE.start_foo_~i~0#1_154| Int) (|ULTIMATE.start_foo_~i~0#1| Int) (v_ArrVal_801 Int) (v_ArrVal_799 Int)) (or (not (<= |v_ULTIMATE.start_foo_~i~0#1_154| (+ |ULTIMATE.start_foo_~i~0#1| 1))) (= (let ((.cse1 (store (store (store (select |c_#memory_int| c_~b~0.base) (+ c_~b~0.offset (* |ULTIMATE.start_foo_~i~0#1| 4)) v_ArrVal_799) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_154| 4)) v_ArrVal_801) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_153| 4)) c_~n~0))) (+ (select .cse1 (+ c_~b~0.offset (- 4))) (* (- 1) (select .cse1 (+ c_~b~0.offset (* c_~n~0 4) (- 8)))))) 0) (not (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 1) c_~n~0)) (not (<= |v_ULTIMATE.start_foo_~i~0#1_153| (+ |v_ULTIMATE.start_foo_~i~0#1_154| 1))) (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 2) c_~n~0)))) is different from false [2022-07-20 05:52:18,348 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_foo_~i~0#1| 4)) (.cse2 (= c_~b~0.offset 4)) (.cse1 (select |c_#memory_int| c_~b~0.base))) (and (or (= (+ c_~a~0.offset .cse0 20) (* c_~n~0 4)) (< c_~b~0.offset 4)) (or (and (<= c_~b~0.offset .cse0) (= c_~n~0 (select .cse1 (+ c_~b~0.offset (- 4))))) (not .cse2)) (= c_~a~0.offset 0) .cse2 (forall ((|v_ULTIMATE.start_foo_~i~0#1_153| Int) (v_ArrVal_796 Int) (|v_ULTIMATE.start_foo_~i~0#1_154| Int) (v_ArrVal_801 Int) (|v_ULTIMATE.start_foo_~i~0#1_156| Int) (v_ArrVal_799 Int)) (or (not (<= |v_ULTIMATE.start_foo_~i~0#1_154| (+ |v_ULTIMATE.start_foo_~i~0#1_156| 1))) (not (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 1) c_~n~0)) (= (let ((.cse3 (store (store (store (store (select |c_#memory_int| c_~b~0.base) (+ c_~b~0.offset (* |c_ULTIMATE.start_foo_~i~0#1| 4)) v_ArrVal_796) (+ (* |v_ULTIMATE.start_foo_~i~0#1_156| 4) c_~b~0.offset) v_ArrVal_799) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_154| 4)) v_ArrVal_801) (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_153| 4)) c_~n~0))) (+ (* (- 1) (select .cse3 (+ c_~b~0.offset (* c_~n~0 4) (- 8)))) (select .cse3 (+ c_~b~0.offset (- 4))))) 0) (not (<= |v_ULTIMATE.start_foo_~i~0#1_153| (+ |v_ULTIMATE.start_foo_~i~0#1_154| 1))) (< (+ |v_ULTIMATE.start_foo_~i~0#1_153| 2) c_~n~0))) (= c_~n~0 (select .cse1 0)) (<= 6 c_~n~0) (<= c_~b~0.offset 4) (exists ((|v_ULTIMATE.start_foo_~i~0#1_151| Int)) (let ((.cse4 (select |c_#memory_int| c_~b~0.base)) (.cse5 (+ |v_ULTIMATE.start_foo_~i~0#1_151| 1))) (and (= c_~n~0 (select .cse4 (+ c_~b~0.offset (* |v_ULTIMATE.start_foo_~i~0#1_151| 4)))) (or (<= |v_ULTIMATE.start_foo_~i~0#1_151| (+ 2 (div (* (- 1) c_~b~0.offset) 4))) (= c_~n~0 (select .cse4 0))) (<= |c_ULTIMATE.start_foo_~i~0#1| .cse5) (< .cse5 c_~n~0)))) (<= 1 |c_ULTIMATE.start_foo_~i~0#1|))) is different from false