./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 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/array-memsafety/cstrcpy-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 05:59:18,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 05:59:18,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 05:59:18,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 05:59:18,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 05:59:18,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 05:59:18,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 05:59:18,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 05:59:18,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 05:59:18,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 05:59:18,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 05:59:18,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 05:59:18,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 05:59:18,506 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 05:59:18,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 05:59:18,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 05:59:18,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 05:59:18,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 05:59:18,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 05:59:18,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 05:59:18,525 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 05:59:18,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 05:59:18,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 05:59:18,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 05:59:18,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 05:59:18,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 05:59:18,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 05:59:18,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 05:59:18,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 05:59:18,535 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 05:59:18,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 05:59:18,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 05:59:18,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 05:59:18,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 05:59:18,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 05:59:18,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 05:59:18,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 05:59:18,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 05:59:18,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 05:59:18,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 05:59:18,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 05:59:18,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 05:59:18,545 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 05:59:18,579 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 05:59:18,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 05:59:18,580 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 05:59:18,581 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 05:59:18,581 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 05:59:18,582 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 05:59:18,582 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 05:59:18,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 05:59:18,583 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 05:59:18,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 05:59:18,584 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 05:59:18,584 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 05:59:18,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 05:59:18,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 05:59:18,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 05:59:18,585 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 05:59:18,585 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 05:59:18,585 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 05:59:18,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 05:59:18,585 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 05:59:18,585 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 05:59:18,586 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 05:59:18,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 05:59:18,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 05:59:18,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 05:59:18,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:59:18,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 05:59:18,587 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 05:59:18,587 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 05:59:18,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 05:59:18,588 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 -> fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 [2022-07-14 05:59:18,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 05:59:18,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 05:59:18,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 05:59:18,811 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 05:59:18,812 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 05:59:18,814 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2022-07-14 05:59:18,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc61dbb2b/b394aa4f0eb641dbb7d295ac9f75ceda/FLAG486ed9560 [2022-07-14 05:59:19,267 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 05:59:19,268 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2022-07-14 05:59:19,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc61dbb2b/b394aa4f0eb641dbb7d295ac9f75ceda/FLAG486ed9560 [2022-07-14 05:59:19,306 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc61dbb2b/b394aa4f0eb641dbb7d295ac9f75ceda [2022-07-14 05:59:19,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 05:59:19,322 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 05:59:19,323 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 05:59:19,323 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 05:59:19,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 05:59:19,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:59:19" (1/1) ... [2022-07-14 05:59:19,328 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@450b48f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:19, skipping insertion in model container [2022-07-14 05:59:19,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 05:59:19" (1/1) ... [2022-07-14 05:59:19,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 05:59:19,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 05:59:19,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:59:19,612 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 05:59:19,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 05:59:19,674 INFO L208 MainTranslator]: Completed translation [2022-07-14 05:59:19,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:19 WrapperNode [2022-07-14 05:59:19,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 05:59:19,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 05:59:19,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 05:59:19,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 05:59:19,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:19" (1/1) ... [2022-07-14 05:59:19,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:19" (1/1) ... [2022-07-14 05:59:19,713 INFO L137 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2022-07-14 05:59:19,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 05:59:19,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 05:59:19,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 05:59:19,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 05:59:19,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:19" (1/1) ... [2022-07-14 05:59:19,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:19" (1/1) ... [2022-07-14 05:59:19,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:19" (1/1) ... [2022-07-14 05:59:19,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:19" (1/1) ... [2022-07-14 05:59:19,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:19" (1/1) ... [2022-07-14 05:59:19,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:19" (1/1) ... [2022-07-14 05:59:19,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:19" (1/1) ... [2022-07-14 05:59:19,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 05:59:19,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 05:59:19,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 05:59:19,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 05:59:19,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:19" (1/1) ... [2022-07-14 05:59:19,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 05:59:19,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:19,809 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-14 05:59:19,811 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-14 05:59:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 05:59:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 05:59:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 05:59:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 05:59:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 05:59:19,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 05:59:19,937 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 05:59:19,952 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 05:59:20,156 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 05:59:20,160 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 05:59:20,164 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 05:59:20,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:59:20 BoogieIcfgContainer [2022-07-14 05:59:20,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 05:59:20,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 05:59:20,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 05:59:20,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 05:59:20,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 05:59:19" (1/3) ... [2022-07-14 05:59:20,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0abf3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:59:20, skipping insertion in model container [2022-07-14 05:59:20,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 05:59:19" (2/3) ... [2022-07-14 05:59:20,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0abf3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 05:59:20, skipping insertion in model container [2022-07-14 05:59:20,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 05:59:20" (3/3) ... [2022-07-14 05:59:20,173 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca-1.i [2022-07-14 05:59:20,184 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 05:59:20,185 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-07-14 05:59:20,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 05:59:20,237 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@467c2044, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@562106ce [2022-07-14 05:59:20,237 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-07-14 05:59:20,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:20,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 05:59:20,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:20,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 05:59:20,252 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:20,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:20,260 INFO L85 PathProgramCache]: Analyzing trace with hash 889510840, now seen corresponding path program 1 times [2022-07-14 05:59:20,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:20,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700586076] [2022-07-14 05:59:20,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:20,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:20,438 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-14 05:59:20,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:20,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700586076] [2022-07-14 05:59:20,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700586076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:20,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:20,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:59:20,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457054406] [2022-07-14 05:59:20,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:20,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:59:20,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:20,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:59:20,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:59:20,470 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) 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-14 05:59:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:20,530 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-07-14 05:59:20,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:59:20,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) 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-14 05:59:20,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:20,538 INFO L225 Difference]: With dead ends: 34 [2022-07-14 05:59:20,538 INFO L226 Difference]: Without dead ends: 30 [2022-07-14 05:59:20,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:59:20,543 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 56 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:20,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 35 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-14 05:59:20,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-07-14 05:59:20,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 27 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-14 05:59:20,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-14 05:59:20,570 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2022-07-14 05:59:20,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:20,570 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-14 05:59:20,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) 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-14 05:59:20,571 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-14 05:59:20,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 05:59:20,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:20,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 05:59:20,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 05:59:20,573 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:20,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:20,573 INFO L85 PathProgramCache]: Analyzing trace with hash 889512762, now seen corresponding path program 1 times [2022-07-14 05:59:20,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:20,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74536360] [2022-07-14 05:59:20,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:20,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:20,610 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-14 05:59:20,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:20,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74536360] [2022-07-14 05:59:20,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74536360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:20,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:20,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:59:20,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140177118] [2022-07-14 05:59:20,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:20,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:59:20,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:20,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:59:20,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:59:20,613 INFO L87 Difference]: Start difference. First operand 28 states and 32 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-14 05:59:20,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:20,639 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-07-14 05:59:20,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:59:20,641 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-14 05:59:20,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:20,641 INFO L225 Difference]: With dead ends: 29 [2022-07-14 05:59:20,641 INFO L226 Difference]: Without dead ends: 28 [2022-07-14 05:59:20,642 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-14 05:59:20,643 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:20,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:20,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-14 05:59:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-14 05:59:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 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-14 05:59:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-14 05:59:20,648 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2022-07-14 05:59:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:20,648 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-14 05:59:20,649 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-14 05:59:20,649 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-14 05:59:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 05:59:20,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:20,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:20,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 05:59:20,650 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:20,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:20,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033015, now seen corresponding path program 1 times [2022-07-14 05:59:20,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:20,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037111148] [2022-07-14 05:59:20,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:20,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:20,698 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-14 05:59:20,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:20,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037111148] [2022-07-14 05:59:20,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037111148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:20,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:20,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 05:59:20,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282285435] [2022-07-14 05:59:20,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:20,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 05:59:20,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:20,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 05:59:20,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 05:59:20,701 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-14 05:59:20,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:20,735 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-07-14 05:59:20,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 05:59:20,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-07-14 05:59:20,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:20,737 INFO L225 Difference]: With dead ends: 25 [2022-07-14 05:59:20,737 INFO L226 Difference]: Without dead ends: 25 [2022-07-14 05:59:20,738 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-14 05:59:20,743 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:20,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:20,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-14 05:59:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-14 05:59:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 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-14 05:59:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-07-14 05:59:20,753 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2022-07-14 05:59:20,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:20,754 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-07-14 05:59:20,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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-14 05:59:20,755 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-07-14 05:59:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 05:59:20,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:20,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:20,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 05:59:20,757 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:20,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:20,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033016, now seen corresponding path program 1 times [2022-07-14 05:59:20,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:20,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942935124] [2022-07-14 05:59:20,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:20,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:20,836 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-14 05:59:20,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:20,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942935124] [2022-07-14 05:59:20,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942935124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:20,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:20,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:59:20,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828874977] [2022-07-14 05:59:20,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:20,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:59:20,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:20,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:59:20,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:59:20,839 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-14 05:59:20,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:20,865 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-07-14 05:59:20,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:59:20,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-07-14 05:59:20,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:20,866 INFO L225 Difference]: With dead ends: 24 [2022-07-14 05:59:20,866 INFO L226 Difference]: Without dead ends: 24 [2022-07-14 05:59:20,867 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-14 05:59:20,872 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:20,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:20,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-14 05:59:20,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-14 05:59:20,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 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-14 05:59:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-14 05:59:20,879 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2022-07-14 05:59:20,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:20,879 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-14 05:59:20,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-14 05:59:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-14 05:59:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 05:59:20,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:20,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:20,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 05:59:20,881 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:20,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033069, now seen corresponding path program 1 times [2022-07-14 05:59:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:20,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580147675] [2022-07-14 05:59:20,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:20,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:20,936 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-14 05:59:20,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:20,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580147675] [2022-07-14 05:59:20,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580147675] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:20,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:20,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:59:20,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370807100] [2022-07-14 05:59:20,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:20,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:59:20,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:20,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:59:20,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:59:20,939 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-14 05:59:20,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:20,962 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-07-14 05:59:20,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:59:20,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-07-14 05:59:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:20,964 INFO L225 Difference]: With dead ends: 40 [2022-07-14 05:59:20,964 INFO L226 Difference]: Without dead ends: 40 [2022-07-14 05:59:20,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-14 05:59:20,966 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:20,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:20,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-14 05:59:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2022-07-14 05:59:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.45) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-14 05:59:20,970 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 7 [2022-07-14 05:59:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:20,970 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-14 05:59:20,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-14 05:59:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-14 05:59:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 05:59:20,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:20,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:20,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 05:59:20,972 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:20,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:20,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1805092651, now seen corresponding path program 1 times [2022-07-14 05:59:20,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:20,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61802784] [2022-07-14 05:59:20,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:20,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:21,035 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-14 05:59:21,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:21,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61802784] [2022-07-14 05:59:21,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61802784] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:21,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:21,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:59:21,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582583141] [2022-07-14 05:59:21,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:21,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:59:21,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:21,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:59:21,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:59:21,040 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-14 05:59:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:21,084 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-07-14 05:59:21,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:59:21,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-07-14 05:59:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:21,085 INFO L225 Difference]: With dead ends: 44 [2022-07-14 05:59:21,085 INFO L226 Difference]: Without dead ends: 44 [2022-07-14 05:59:21,086 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-14 05:59:21,086 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 56 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:21,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 33 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-14 05:59:21,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2022-07-14 05:59:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 27 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-14 05:59:21,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-14 05:59:21,090 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 7 [2022-07-14 05:59:21,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:21,090 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-14 05:59:21,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-14 05:59:21,090 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-14 05:59:21,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 05:59:21,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:21,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:21,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 05:59:21,091 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:21,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:21,091 INFO L85 PathProgramCache]: Analyzing trace with hash 748014037, now seen corresponding path program 1 times [2022-07-14 05:59:21,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:21,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136407311] [2022-07-14 05:59:21,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:21,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:21,201 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-14 05:59:21,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:21,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136407311] [2022-07-14 05:59:21,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136407311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:21,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:21,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 05:59:21,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538531434] [2022-07-14 05:59:21,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:21,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 05:59:21,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:21,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 05:59:21,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:59:21,202 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:21,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:21,312 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-07-14 05:59:21,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:59:21,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-14 05:59:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:21,316 INFO L225 Difference]: With dead ends: 35 [2022-07-14 05:59:21,316 INFO L226 Difference]: Without dead ends: 35 [2022-07-14 05:59:21,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-14 05:59:21,317 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 85 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:21,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 48 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:59:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-14 05:59:21,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2022-07-14 05:59:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:21,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-14 05:59:21,323 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2022-07-14 05:59:21,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:21,323 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-14 05:59:21,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-14 05:59:21,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 05:59:21,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:21,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:21,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 05:59:21,324 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:21,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:21,324 INFO L85 PathProgramCache]: Analyzing trace with hash 748014036, now seen corresponding path program 1 times [2022-07-14 05:59:21,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:21,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429052457] [2022-07-14 05:59:21,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:21,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:21,369 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-14 05:59:21,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:21,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429052457] [2022-07-14 05:59:21,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429052457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:21,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:21,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:59:21,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709410825] [2022-07-14 05:59:21,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:21,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 05:59:21,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:21,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 05:59:21,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:59:21,371 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:21,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:21,402 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-07-14 05:59:21,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:59:21,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-14 05:59:21,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:21,403 INFO L225 Difference]: With dead ends: 29 [2022-07-14 05:59:21,403 INFO L226 Difference]: Without dead ends: 29 [2022-07-14 05:59:21,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 05:59:21,404 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:21,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 37 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:21,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-14 05:59:21,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-14 05:59:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 28 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-14 05:59:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-07-14 05:59:21,406 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 10 [2022-07-14 05:59:21,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:21,406 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-07-14 05:59:21,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:21,407 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-07-14 05:59:21,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:59:21,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:21,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:21,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 05:59:21,407 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:21,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:21,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1713598655, now seen corresponding path program 1 times [2022-07-14 05:59:21,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:21,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200092431] [2022-07-14 05:59:21,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:21,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:21,468 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-14 05:59:21,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:21,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200092431] [2022-07-14 05:59:21,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200092431] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:21,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:21,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:59:21,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247014889] [2022-07-14 05:59:21,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:21,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:59:21,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:21,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:59:21,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:59:21,471 INFO L87 Difference]: Start difference. First operand 29 states and 33 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-14 05:59:21,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:21,501 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-07-14 05:59:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 05:59:21,502 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-14 05:59:21,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:21,503 INFO L225 Difference]: With dead ends: 28 [2022-07-14 05:59:21,503 INFO L226 Difference]: Without dead ends: 28 [2022-07-14 05:59:21,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:59:21,505 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:21,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 44 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:21,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-14 05:59:21,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-14 05:59:21,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 27 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-14 05:59:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-14 05:59:21,515 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 11 [2022-07-14 05:59:21,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:21,515 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-14 05:59:21,516 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-14 05:59:21,516 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-14 05:59:21,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:59:21,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:21,517 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:21,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 05:59:21,517 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:21,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:21,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1713598656, now seen corresponding path program 1 times [2022-07-14 05:59:21,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:21,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888824287] [2022-07-14 05:59:21,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:21,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:21,582 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-14 05:59:21,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:21,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888824287] [2022-07-14 05:59:21,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888824287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:21,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:21,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 05:59:21,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749420890] [2022-07-14 05:59:21,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:21,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 05:59:21,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:21,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 05:59:21,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 05:59:21,584 INFO L87 Difference]: Start difference. First operand 28 states and 32 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-14 05:59:21,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:21,629 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-07-14 05:59:21,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 05:59:21,629 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-14 05:59:21,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:21,629 INFO L225 Difference]: With dead ends: 30 [2022-07-14 05:59:21,630 INFO L226 Difference]: Without dead ends: 30 [2022-07-14 05:59:21,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:59:21,630 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 45 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:21,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-14 05:59:21,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-07-14 05:59:21,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.32) internal successors, (33), 28 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-14 05:59:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-07-14 05:59:21,643 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 11 [2022-07-14 05:59:21,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:21,643 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-07-14 05:59:21,643 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-14 05:59:21,644 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-07-14 05:59:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:59:21,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:21,644 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:21,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 05:59:21,645 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:21,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:21,645 INFO L85 PathProgramCache]: Analyzing trace with hash 952918382, now seen corresponding path program 1 times [2022-07-14 05:59:21,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:21,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821744277] [2022-07-14 05:59:21,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:21,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 05:59:21,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:21,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821744277] [2022-07-14 05:59:21,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821744277] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:21,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:21,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 05:59:21,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435988275] [2022-07-14 05:59:21,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:21,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:59:21,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:21,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:59:21,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:59:21,697 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-14 05:59:21,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:21,715 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-07-14 05:59:21,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:59:21,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-14 05:59:21,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:21,717 INFO L225 Difference]: With dead ends: 49 [2022-07-14 05:59:21,717 INFO L226 Difference]: Without dead ends: 49 [2022-07-14 05:59:21,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 05:59:21,718 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:21,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:21,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-14 05:59:21,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2022-07-14 05:59:21,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-14 05:59:21,724 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 11 [2022-07-14 05:59:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:21,724 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-14 05:59:21,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-14 05:59:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-14 05:59:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 05:59:21,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:21,726 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:21,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 05:59:21,728 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:21,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:21,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1632976752, now seen corresponding path program 1 times [2022-07-14 05:59:21,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:21,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805502635] [2022-07-14 05:59:21,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:21,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:21,775 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-14 05:59:21,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:21,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805502635] [2022-07-14 05:59:21,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805502635] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:21,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943950403] [2022-07-14 05:59:21,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:21,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:21,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:21,777 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-14 05:59:21,781 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-14 05:59:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:21,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 05:59:21,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:21,927 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:59:21,928 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-14 05:59:22,008 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-14 05:59:22,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:22,107 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-14 05:59:22,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943950403] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:22,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:22,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-14 05:59:22,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94598537] [2022-07-14 05:59:22,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:22,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 05:59:22,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:22,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 05:59:22,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-14 05:59:22,109 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 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-14 05:59:22,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:22,206 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2022-07-14 05:59:22,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 05:59:22,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 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 11 [2022-07-14 05:59:22,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:22,208 INFO L225 Difference]: With dead ends: 62 [2022-07-14 05:59:22,208 INFO L226 Difference]: Without dead ends: 62 [2022-07-14 05:59:22,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-14 05:59:22,209 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 84 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:22,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 91 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:59:22,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-14 05:59:22,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 27. [2022-07-14 05:59:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-14 05:59:22,220 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 11 [2022-07-14 05:59:22,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:22,220 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-14 05:59:22,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 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-14 05:59:22,220 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-14 05:59:22,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 05:59:22,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:22,221 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:22,242 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-14 05:59:22,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-14 05:59:22,442 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:22,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:22,442 INFO L85 PathProgramCache]: Analyzing trace with hash -163723683, now seen corresponding path program 1 times [2022-07-14 05:59:22,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:22,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438125755] [2022-07-14 05:59:22,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:22,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:22,516 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-14 05:59:22,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:22,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438125755] [2022-07-14 05:59:22,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438125755] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:22,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:22,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 05:59:22,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630408007] [2022-07-14 05:59:22,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:22,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 05:59:22,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:22,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 05:59:22,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:59:22,518 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-14 05:59:22,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:22,589 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-07-14 05:59:22,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 05:59:22,590 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-14 05:59:22,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:22,590 INFO L225 Difference]: With dead ends: 39 [2022-07-14 05:59:22,590 INFO L226 Difference]: Without dead ends: 39 [2022-07-14 05:59:22,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-14 05:59:22,591 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:22,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 92 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:22,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-14 05:59:22,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-07-14 05:59:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 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-14 05:59:22,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-07-14 05:59:22,593 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2022-07-14 05:59:22,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:22,593 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-07-14 05:59:22,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-14 05:59:22,593 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-07-14 05:59:22,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 05:59:22,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:22,594 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:22,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 05:59:22,594 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:22,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:22,595 INFO L85 PathProgramCache]: Analyzing trace with hash 537340895, now seen corresponding path program 1 times [2022-07-14 05:59:22,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:22,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249115527] [2022-07-14 05:59:22,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:22,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:22,699 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-14 05:59:22,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:22,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249115527] [2022-07-14 05:59:22,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249115527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:22,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:22,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 05:59:22,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431889291] [2022-07-14 05:59:22,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:22,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 05:59:22,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:22,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 05:59:22,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:59:22,701 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-14 05:59:22,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:22,785 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-07-14 05:59:22,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 05:59:22,785 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-14 05:59:22,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:22,786 INFO L225 Difference]: With dead ends: 53 [2022-07-14 05:59:22,786 INFO L226 Difference]: Without dead ends: 53 [2022-07-14 05:59:22,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-14 05:59:22,787 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:22,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 110 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-14 05:59:22,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2022-07-14 05:59:22,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-14 05:59:22,789 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2022-07-14 05:59:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:22,790 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-14 05:59:22,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-14 05:59:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-14 05:59:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 05:59:22,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:22,791 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:22,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 05:59:22,791 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:22,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash 795506333, now seen corresponding path program 1 times [2022-07-14 05:59:22,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:22,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801424045] [2022-07-14 05:59:22,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:22,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:22,911 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-14 05:59:22,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:22,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801424045] [2022-07-14 05:59:22,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801424045] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:22,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:22,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 05:59:22,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550771299] [2022-07-14 05:59:22,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:22,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 05:59:22,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:22,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 05:59:22,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 05:59:22,915 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-14 05:59:23,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:23,125 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-07-14 05:59:23,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 05:59:23,126 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-14 05:59:23,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:23,126 INFO L225 Difference]: With dead ends: 47 [2022-07-14 05:59:23,126 INFO L226 Difference]: Without dead ends: 47 [2022-07-14 05:59:23,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-14 05:59:23,127 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:23,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 95 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:59:23,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-14 05:59:23,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2022-07-14 05:59:23,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 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-14 05:59:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-07-14 05:59:23,129 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2022-07-14 05:59:23,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:23,129 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-07-14 05:59:23,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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-14 05:59:23,129 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-07-14 05:59:23,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 05:59:23,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:23,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:23,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 05:59:23,130 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:23,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:23,131 INFO L85 PathProgramCache]: Analyzing trace with hash -780511546, now seen corresponding path program 1 times [2022-07-14 05:59:23,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:23,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365606385] [2022-07-14 05:59:23,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:23,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:23,172 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-14 05:59:23,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:23,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365606385] [2022-07-14 05:59:23,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365606385] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 05:59:23,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 05:59:23,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 05:59:23,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622593274] [2022-07-14 05:59:23,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 05:59:23,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 05:59:23,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:23,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 05:59:23,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:59:23,174 INFO L87 Difference]: Start difference. First operand 34 states and 39 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-14 05:59:23,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:23,183 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-07-14 05:59:23,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 05:59:23,183 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-14 05:59:23,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:23,184 INFO L225 Difference]: With dead ends: 33 [2022-07-14 05:59:23,184 INFO L226 Difference]: Without dead ends: 21 [2022-07-14 05:59:23,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 05:59:23,184 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:23,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 05:59:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-14 05:59:23,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-14 05:59:23,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 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-14 05:59:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-07-14 05:59:23,186 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2022-07-14 05:59:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:23,186 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-07-14 05:59:23,186 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-14 05:59:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-07-14 05:59:23,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 05:59:23,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:23,187 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:23,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 05:59:23,187 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:23,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:23,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2086958086, now seen corresponding path program 1 times [2022-07-14 05:59:23,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:23,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916463375] [2022-07-14 05:59:23,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:23,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:23,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:23,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916463375] [2022-07-14 05:59:23,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916463375] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:23,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079328001] [2022-07-14 05:59:23,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:23,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:23,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:23,302 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-14 05:59:23,303 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-14 05:59:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:23,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-14 05:59:23,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:23,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:23,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:23,571 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 5 treesize of output 3 [2022-07-14 05:59:23,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:23,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079328001] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:23,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:23,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-07-14 05:59:23,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4690269] [2022-07-14 05:59:23,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:23,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 05:59:23,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:23,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 05:59:23,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-07-14 05:59:23,593 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 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-14 05:59:23,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:23,789 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-07-14 05:59:23,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 05:59:23,790 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 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 18 [2022-07-14 05:59:23,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:23,790 INFO L225 Difference]: With dead ends: 30 [2022-07-14 05:59:23,790 INFO L226 Difference]: Without dead ends: 30 [2022-07-14 05:59:23,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2022-07-14 05:59:23,791 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 88 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:23,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 70 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:59:23,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-14 05:59:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-07-14 05:59:23,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 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-14 05:59:23,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-14 05:59:23,793 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2022-07-14 05:59:23,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:23,793 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-14 05:59:23,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 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-14 05:59:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-14 05:59:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 05:59:23,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:23,794 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:23,823 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-14 05:59:24,003 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,SelfDestructingSolverStorable16 [2022-07-14 05:59:24,004 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:24,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:24,004 INFO L85 PathProgramCache]: Analyzing trace with hash -271191237, now seen corresponding path program 1 times [2022-07-14 05:59:24,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:24,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165123307] [2022-07-14 05:59:24,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:24,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:24,111 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-14 05:59:24,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:24,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165123307] [2022-07-14 05:59:24,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165123307] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:24,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476497529] [2022-07-14 05:59:24,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:24,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:24,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:24,113 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-14 05:59:24,114 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-14 05:59:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:24,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-14 05:59:24,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:24,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:59:24,184 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-14 05:59:24,188 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-14 05:59:24,294 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-14 05:59:24,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:24,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476497529] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:24,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:24,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-07-14 05:59:24,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205862738] [2022-07-14 05:59:24,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:24,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-14 05:59:24,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:24,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-14 05:59:24,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-07-14 05:59:24,462 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 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-14 05:59:24,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:24,698 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-07-14 05:59:24,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 05:59:24,698 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 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 19 [2022-07-14 05:59:24,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:24,699 INFO L225 Difference]: With dead ends: 29 [2022-07-14 05:59:24,699 INFO L226 Difference]: Without dead ends: 29 [2022-07-14 05:59:24,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2022-07-14 05:59:24,699 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 58 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:24,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 73 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:59:24,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-14 05:59:24,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-07-14 05:59:24,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 05:59:24,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-07-14 05:59:24,701 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2022-07-14 05:59:24,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:24,701 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-14 05:59:24,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 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-14 05:59:24,701 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-07-14 05:59:24,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 05:59:24,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:24,701 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:24,732 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-14 05:59:24,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 05:59:24,902 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:24,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:24,902 INFO L85 PathProgramCache]: Analyzing trace with hash -224662014, now seen corresponding path program 2 times [2022-07-14 05:59:24,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:24,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179339999] [2022-07-14 05:59:24,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:24,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:25,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:25,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179339999] [2022-07-14 05:59:25,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179339999] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:25,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265515134] [2022-07-14 05:59:25,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 05:59:25,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:25,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:25,092 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-14 05:59:25,143 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-14 05:59:25,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 05:59:25,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:59:25,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-14 05:59:25,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:25,203 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-14 05:59:25,247 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 14 treesize of output 10 [2022-07-14 05:59:25,413 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 17 treesize of output 19 [2022-07-14 05:59:25,514 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:25,515 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 20 treesize of output 20 [2022-07-14 05:59:25,629 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:25,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:25,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| Int) (v_ArrVal_188 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_188) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 1)) 0) (<= (+ 3 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-14 05:59:25,867 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| Int) (v_ArrVal_188 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|)) (<= (+ 3 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_188) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 1)) 0))) is different from false [2022-07-14 05:59:25,890 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:25,891 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 23 treesize of output 24 [2022-07-14 05:59:25,905 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:25,905 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 37 treesize of output 37 [2022-07-14 05:59:25,911 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 11 treesize of output 7 [2022-07-14 05:59:25,915 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 16 treesize of output 12 [2022-07-14 05:59:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-14 05:59:26,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265515134] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:26,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:26,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2022-07-14 05:59:26,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513879455] [2022-07-14 05:59:26,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:26,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-14 05:59:26,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:26,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-14 05:59:26,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=950, Unknown=2, NotChecked=126, Total=1190 [2022-07-14 05:59:26,032 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 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-14 05:59:26,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:26,532 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2022-07-14 05:59:26,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 05:59:26,532 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 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) Word has length 22 [2022-07-14 05:59:26,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:26,533 INFO L225 Difference]: With dead ends: 48 [2022-07-14 05:59:26,533 INFO L226 Difference]: Without dead ends: 38 [2022-07-14 05:59:26,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=239, Invalid=1929, Unknown=2, NotChecked=182, Total=2352 [2022-07-14 05:59:26,534 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:26,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 141 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 212 Invalid, 0 Unknown, 139 Unchecked, 0.1s Time] [2022-07-14 05:59:26,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-14 05:59:26,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-07-14 05:59:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1) internal successors, (33), 31 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-14 05:59:26,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-07-14 05:59:26,535 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 22 [2022-07-14 05:59:26,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:26,535 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-07-14 05:59:26,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 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-14 05:59:26,535 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-07-14 05:59:26,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 05:59:26,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:26,536 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:26,578 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-14 05:59:26,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:26,736 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:26,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:26,737 INFO L85 PathProgramCache]: Analyzing trace with hash -121211530, now seen corresponding path program 2 times [2022-07-14 05:59:26,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:26,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943100758] [2022-07-14 05:59:26,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:26,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:26,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:26,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943100758] [2022-07-14 05:59:26,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943100758] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:26,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831924748] [2022-07-14 05:59:26,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 05:59:26,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:26,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:26,904 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-14 05:59:26,924 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-14 05:59:26,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 05:59:26,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:59:26,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-14 05:59:26,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:26,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:59:26,993 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-14 05:59:27,002 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-14 05:59:27,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:27,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:27,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831924748] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:27,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:27,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2022-07-14 05:59:27,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605189058] [2022-07-14 05:59:27,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:27,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-14 05:59:27,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:27,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-14 05:59:27,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2022-07-14 05:59:27,382 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 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-14 05:59:27,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:27,713 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-07-14 05:59:27,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 05:59:27,714 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 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 27 [2022-07-14 05:59:27,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:27,714 INFO L225 Difference]: With dead ends: 34 [2022-07-14 05:59:27,714 INFO L226 Difference]: Without dead ends: 34 [2022-07-14 05:59:27,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=1025, Unknown=0, NotChecked=0, Total=1260 [2022-07-14 05:59:27,715 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 84 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:27,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 100 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 05:59:27,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-14 05:59:27,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-07-14 05:59:27,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 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-14 05:59:27,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-07-14 05:59:27,717 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 27 [2022-07-14 05:59:27,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:27,717 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-07-14 05:59:27,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 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-14 05:59:27,717 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-07-14 05:59:27,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 05:59:27,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:27,717 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:27,737 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-14 05:59:27,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:27,918 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:27,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:27,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1054801383, now seen corresponding path program 3 times [2022-07-14 05:59:27,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:27,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33868314] [2022-07-14 05:59:27,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:27,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:28,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:28,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33868314] [2022-07-14 05:59:28,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33868314] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:28,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047510923] [2022-07-14 05:59:28,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 05:59:28,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:28,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:28,144 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-14 05:59:28,152 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-14 05:59:28,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-14 05:59:28,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:59:28,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-14 05:59:28,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:28,271 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-14 05:59:28,424 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 14 treesize of output 10 [2022-07-14 05:59:28,560 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 16 treesize of output 18 [2022-07-14 05:59:28,665 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 16 treesize of output 18 [2022-07-14 05:59:28,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:59:28,744 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:28,745 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 17 treesize of output 10 [2022-07-14 05:59:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:28,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:28,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|))) is different from false [2022-07-14 05:59:28,771 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 05:59:28,778 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_260) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 05:59:28,788 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 05:59:28,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 05:59:28,800 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:28,801 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 23 treesize of output 24 [2022-07-14 05:59:28,808 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:28,808 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 37 treesize of output 37 [2022-07-14 05:59:28,812 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 11 treesize of output 7 [2022-07-14 05:59:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-14 05:59:28,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047510923] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:28,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:28,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 39 [2022-07-14 05:59:28,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210041852] [2022-07-14 05:59:28,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:28,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-14 05:59:28,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:28,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-14 05:59:28,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1015, Unknown=5, NotChecked=340, Total=1482 [2022-07-14 05:59:28,974 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 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-14 05:59:29,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:29,275 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-07-14 05:59:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 05:59:29,276 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 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 30 [2022-07-14 05:59:29,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:29,276 INFO L225 Difference]: With dead ends: 54 [2022-07-14 05:59:29,276 INFO L226 Difference]: Without dead ends: 40 [2022-07-14 05:59:29,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 3 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=1553, Unknown=5, NotChecked=420, Total=2162 [2022-07-14 05:59:29,278 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:29,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 163 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 191 Invalid, 0 Unknown, 127 Unchecked, 0.1s Time] [2022-07-14 05:59:29,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-14 05:59:29,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-07-14 05:59:29,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 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-14 05:59:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-07-14 05:59:29,280 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 30 [2022-07-14 05:59:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:29,280 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-07-14 05:59:29,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 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-14 05:59:29,280 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-07-14 05:59:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 05:59:29,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:29,281 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:29,327 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-14 05:59:29,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:29,495 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:29,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:29,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1308342596, now seen corresponding path program 4 times [2022-07-14 05:59:29,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:29,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928355601] [2022-07-14 05:59:29,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:29,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:29,660 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:29,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:29,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928355601] [2022-07-14 05:59:29,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928355601] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:29,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414407615] [2022-07-14 05:59:29,661 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 05:59:29,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:29,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:29,676 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-14 05:59:29,678 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-14 05:59:29,751 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 05:59:29,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:59:29,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-14 05:59:29,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:29,763 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-14 05:59:29,767 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-14 05:59:29,894 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 16 treesize of output 12 [2022-07-14 05:59:30,026 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 21 [2022-07-14 05:59:30,136 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 21 [2022-07-14 05:59:30,256 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:30,256 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 22 treesize of output 22 [2022-07-14 05:59:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:30,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:30,779 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_307 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 4) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) 0))) is different from false [2022-07-14 05:59:30,793 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_307 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) 0) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 4) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|))) is different from false [2022-07-14 05:59:30,801 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:30,802 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 23 treesize of output 24 [2022-07-14 05:59:30,808 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:30,809 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 37 treesize of output 37 [2022-07-14 05:59:30,813 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 11 treesize of output 7 [2022-07-14 05:59:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-14 05:59:31,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414407615] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:31,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:31,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 42 [2022-07-14 05:59:31,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327546960] [2022-07-14 05:59:31,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:31,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-14 05:59:31,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:31,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-14 05:59:31,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1456, Unknown=2, NotChecked=158, Total=1806 [2022-07-14 05:59:31,372 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 states have internal predecessors, (94), 0 states have call successors, (0), 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-14 05:59:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:31,930 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-07-14 05:59:31,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 05:59:31,932 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 states have internal predecessors, (94), 0 states have call successors, (0), 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 34 [2022-07-14 05:59:31,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:31,933 INFO L225 Difference]: With dead ends: 43 [2022-07-14 05:59:31,933 INFO L226 Difference]: Without dead ends: 43 [2022-07-14 05:59:31,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=381, Invalid=2595, Unknown=2, NotChecked=214, Total=3192 [2022-07-14 05:59:31,934 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:31,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 211 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 250 Invalid, 0 Unknown, 155 Unchecked, 0.1s Time] [2022-07-14 05:59:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-14 05:59:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-07-14 05:59:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 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-14 05:59:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2022-07-14 05:59:31,936 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 34 [2022-07-14 05:59:31,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:31,936 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2022-07-14 05:59:31,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 states have internal predecessors, (94), 0 states have call successors, (0), 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-14 05:59:31,937 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-07-14 05:59:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-14 05:59:31,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:31,937 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:31,977 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-14 05:59:32,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:32,152 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:32,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:32,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1903914801, now seen corresponding path program 3 times [2022-07-14 05:59:32,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:32,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283397231] [2022-07-14 05:59:32,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:32,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:32,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:32,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283397231] [2022-07-14 05:59:32,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283397231] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:32,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545249969] [2022-07-14 05:59:32,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 05:59:32,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:32,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:32,282 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-14 05:59:32,313 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-14 05:59:32,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-14 05:59:32,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:59:32,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-14 05:59:32,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:32,396 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 05:59:32,396 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-14 05:59:32,405 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-14 05:59:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 05:59:32,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 05:59:33,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545249969] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 05:59:33,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 05:59:33,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2022-07-14 05:59:33,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367613993] [2022-07-14 05:59:33,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 05:59:33,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-14 05:59:33,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 05:59:33,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-14 05:59:33,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2022-07-14 05:59:33,182 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 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-14 05:59:34,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 05:59:34,304 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2022-07-14 05:59:34,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-14 05:59:34,304 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 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) Word has length 35 [2022-07-14 05:59:34,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 05:59:34,305 INFO L225 Difference]: With dead ends: 56 [2022-07-14 05:59:34,305 INFO L226 Difference]: Without dead ends: 56 [2022-07-14 05:59:34,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=437, Invalid=2113, Unknown=0, NotChecked=0, Total=2550 [2022-07-14 05:59:34,306 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 90 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 05:59:34,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 125 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 367 Invalid, 0 Unknown, 11 Unchecked, 0.2s Time] [2022-07-14 05:59:34,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-14 05:59:34,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2022-07-14 05:59:34,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 52 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-14 05:59:34,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-07-14 05:59:34,308 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 35 [2022-07-14 05:59:34,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 05:59:34,309 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-07-14 05:59:34,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 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-14 05:59:34,309 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-07-14 05:59:34,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-14 05:59:34,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 05:59:34,310 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 05:59:34,334 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-14 05:59:34,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-14 05:59:34,517 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 05:59:34,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 05:59:34,518 INFO L85 PathProgramCache]: Analyzing trace with hash 187721292, now seen corresponding path program 5 times [2022-07-14 05:59:34,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 05:59:34,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514010439] [2022-07-14 05:59:34,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 05:59:34,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 05:59:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 05:59:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:34,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 05:59:34,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514010439] [2022-07-14 05:59:34,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514010439] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 05:59:34,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032817214] [2022-07-14 05:59:34,825 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 05:59:34,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 05:59:34,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 05:59:34,826 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-14 05:59:34,826 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-14 05:59:34,934 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-14 05:59:34,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 05:59:34,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-14 05:59:34,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 05:59:35,151 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-14 05:59:35,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:59:35,297 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 22 treesize of output 21 [2022-07-14 05:59:35,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:59:35,418 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 22 treesize of output 21 [2022-07-14 05:59:35,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 05:59:35,529 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 22 treesize of output 21 [2022-07-14 05:59:35,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 05:59:35,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 05:59:35,615 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 18 treesize of output 10 [2022-07-14 05:59:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 05:59:35,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 05:59:57,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (v_ArrVal_394 Int)) (or (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base|) |c_ULTIMATE.start_cstrcpy_#t~post2#1.offset| v_ArrVal_394)))) (store .cse0 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398))) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset|)))) is different from false [2022-07-14 05:59:59,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset|)) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) is different from false [2022-07-14 06:00:01,998 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| Int)) (or (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (< |c_ULTIMATE.start_main_~nondetArea~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59|) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) is different from false [2022-07-14 06:00:02,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 776 treesize of output 764 [2022-07-14 06:00:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-14 06:00:03,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032817214] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:03,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:03,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 49 [2022-07-14 06:00:03,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091943769] [2022-07-14 06:00:03,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:03,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-14 06:00:03,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:03,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-14 06:00:03,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1925, Unknown=13, NotChecked=270, Total=2352 [2022-07-14 06:00:03,588 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 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-14 06:00:06,030 WARN L833 $PredicateComparison]: unable to prove that (and (< 3 |c_ULTIMATE.start_main_~length2~0#1|) (<= |c_ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 4 |c_ULTIMATE.start_main_~length2~0#1|) (<= |c_ULTIMATE.start_main_~length2~0#1| 4) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| Int)) (or (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (< |c_ULTIMATE.start_main_~nondetArea~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59|) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (<= |ULTIMATE.start_main_~length2~0#1| 4) (< 3 |ULTIMATE.start_main_~length2~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0))) (<= 0 |c_ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |c_ULTIMATE.start_main_~i~0#1| 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:08,052 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset|)) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (<= |ULTIMATE.start_main_~length2~0#1| 4) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (< 3 |ULTIMATE.start_main_~length2~0#1|))) (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) 3) 0) (<= |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset| 0) (not (= |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) is different from false [2022-07-14 06:00:08,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:08,401 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-07-14 06:00:08,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 06:00:08,402 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 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) Word has length 38 [2022-07-14 06:00:08,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:08,403 INFO L225 Difference]: With dead ends: 78 [2022-07-14 06:00:08,403 INFO L226 Difference]: Without dead ends: 60 [2022-07-14 06:00:08,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=251, Invalid=3294, Unknown=15, NotChecked=600, Total=4160 [2022-07-14 06:00:08,408 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:08,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 353 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 399 Invalid, 0 Unknown, 279 Unchecked, 0.2s Time] [2022-07-14 06:00:08,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-14 06:00:08,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-07-14 06:00:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 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-14 06:00:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-07-14 06:00:08,412 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 38 [2022-07-14 06:00:08,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:08,412 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-07-14 06:00:08,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 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-14 06:00:08,412 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-07-14 06:00:08,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 06:00:08,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:08,412 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:08,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-14 06:00:08,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-14 06:00:08,628 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:00:08,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:08,628 INFO L85 PathProgramCache]: Analyzing trace with hash 406746281, now seen corresponding path program 6 times [2022-07-14 06:00:08,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:08,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179483412] [2022-07-14 06:00:08,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:08,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:08,840 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:08,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:08,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179483412] [2022-07-14 06:00:08,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179483412] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:08,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50244242] [2022-07-14 06:00:08,841 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 06:00:08,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:08,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:08,842 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-14 06:00:08,843 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-14 06:00:08,948 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-14 06:00:08,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:08,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-14 06:00:08,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:09,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:09,348 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 22 treesize of output 18 [2022-07-14 06:00:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:09,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50244242] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:09,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:09,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2022-07-14 06:00:09,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878763036] [2022-07-14 06:00:09,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:09,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-14 06:00:09,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:09,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-14 06:00:09,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2022-07-14 06:00:09,537 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 34 states, 33 states have (on average 3.090909090909091) internal successors, (102), 34 states have internal predecessors, (102), 0 states have call successors, (0), 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-14 06:00:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:09,980 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2022-07-14 06:00:09,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:00:09,981 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.090909090909091) internal successors, (102), 34 states have internal predecessors, (102), 0 states have call successors, (0), 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 42 [2022-07-14 06:00:09,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:09,982 INFO L225 Difference]: With dead ends: 57 [2022-07-14 06:00:09,982 INFO L226 Difference]: Without dead ends: 57 [2022-07-14 06:00:09,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=437, Invalid=1633, Unknown=0, NotChecked=0, Total=2070 [2022-07-14 06:00:09,983 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 266 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:09,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 146 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:00:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-14 06:00:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-07-14 06:00:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 56 states have internal predecessors, (60), 0 states have call successors, (0), 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-14 06:00:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2022-07-14 06:00:09,985 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 42 [2022-07-14 06:00:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:09,985 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2022-07-14 06:00:09,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.090909090909091) internal successors, (102), 34 states have internal predecessors, (102), 0 states have call successors, (0), 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-14 06:00:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2022-07-14 06:00:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:00:09,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:09,986 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:10,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-14 06:00:10,199 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,SelfDestructingSolverStorable24 [2022-07-14 06:00:10,199 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:00:10,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:10,200 INFO L85 PathProgramCache]: Analyzing trace with hash 892135217, now seen corresponding path program 7 times [2022-07-14 06:00:10,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:10,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979792918] [2022-07-14 06:00:10,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:10,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:10,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:10,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979792918] [2022-07-14 06:00:10,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979792918] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:10,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818448006] [2022-07-14 06:00:10,595 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-14 06:00:10,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:10,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:10,597 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-14 06:00:10,598 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-14 06:00:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:10,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-14 06:00:10,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:10,695 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-14 06:00:10,912 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 14 treesize of output 10 [2022-07-14 06:00:11,045 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 17 treesize of output 19 [2022-07-14 06:00:11,101 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 16 treesize of output 18 [2022-07-14 06:00:11,140 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 16 treesize of output 18 [2022-07-14 06:00:11,151 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-14 06:00:11,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:00:11,161 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:11,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:11,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-14 06:00:11,184 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:11,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_502) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:11,195 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:11,201 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_501) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:11,207 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:11,214 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_500) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:11,220 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:11,225 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:00:11,230 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:11,230 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 23 treesize of output 24 [2022-07-14 06:00:11,236 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:11,236 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 37 treesize of output 37 [2022-07-14 06:00:11,239 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 11 treesize of output 7 [2022-07-14 06:00:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 39 not checked. [2022-07-14 06:00:11,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818448006] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:11,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:11,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 48 [2022-07-14 06:00:11,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425116735] [2022-07-14 06:00:11,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:11,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-14 06:00:11,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:11,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-14 06:00:11,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1375, Unknown=9, NotChecked=738, Total=2256 [2022-07-14 06:00:11,412 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 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-14 06:00:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:12,105 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-07-14 06:00:12,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-14 06:00:12,106 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 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 46 [2022-07-14 06:00:12,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:12,106 INFO L225 Difference]: With dead ends: 86 [2022-07-14 06:00:12,106 INFO L226 Difference]: Without dead ends: 64 [2022-07-14 06:00:12,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 65 SyntacticMatches, 15 SemanticMatches, 55 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=196, Invalid=2087, Unknown=9, NotChecked=900, Total=3192 [2022-07-14 06:00:12,107 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 388 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:12,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 343 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 512 Invalid, 0 Unknown, 388 Unchecked, 0.2s Time] [2022-07-14 06:00:12,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-14 06:00:12,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2022-07-14 06:00:12,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.0847457627118644) 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-14 06:00:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-07-14 06:00:12,109 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 46 [2022-07-14 06:00:12,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:12,109 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-07-14 06:00:12,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 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-14 06:00:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-07-14 06:00:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 06:00:12,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:12,110 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:12,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-14 06:00:12,323 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,SelfDestructingSolverStorable25 [2022-07-14 06:00:12,323 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:00:12,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:12,324 INFO L85 PathProgramCache]: Analyzing trace with hash -282507122, now seen corresponding path program 8 times [2022-07-14 06:00:12,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:12,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441399516] [2022-07-14 06:00:12,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:12,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:12,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:12,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441399516] [2022-07-14 06:00:12,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441399516] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:12,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510537724] [2022-07-14 06:00:12,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:00:12,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:12,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:12,546 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-14 06:00:12,546 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-14 06:00:12,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:00:12,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:12,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-14 06:00:12,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:12,857 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:12,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:13,112 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 5 treesize of output 3 [2022-07-14 06:00:13,146 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:13,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510537724] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:13,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:13,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2022-07-14 06:00:13,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888876786] [2022-07-14 06:00:13,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:13,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-14 06:00:13,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:13,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-14 06:00:13,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2022-07-14 06:00:13,148 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 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-14 06:00:13,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:13,640 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-07-14 06:00:13,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:00:13,640 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 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-14 06:00:13,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:13,641 INFO L225 Difference]: With dead ends: 61 [2022-07-14 06:00:13,641 INFO L226 Difference]: Without dead ends: 61 [2022-07-14 06:00:13,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=449, Invalid=1903, Unknown=0, NotChecked=0, Total=2352 [2022-07-14 06:00:13,642 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 84 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:13,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 221 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:00:13,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-14 06:00:13,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-07-14 06:00:13,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 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-14 06:00:13,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-07-14 06:00:13,644 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 50 [2022-07-14 06:00:13,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:13,644 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-07-14 06:00:13,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 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-14 06:00:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-07-14 06:00:13,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 06:00:13,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:13,645 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:13,662 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-14 06:00:13,855 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,SelfDestructingSolverStorable26 [2022-07-14 06:00:13,856 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:00:13,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:13,856 INFO L85 PathProgramCache]: Analyzing trace with hash 823214230, now seen corresponding path program 9 times [2022-07-14 06:00:13,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:13,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509112069] [2022-07-14 06:00:13,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:13,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:14,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:14,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509112069] [2022-07-14 06:00:14,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509112069] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:14,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765230344] [2022-07-14 06:00:14,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:00:14,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:14,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:14,416 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-14 06:00:14,417 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-14 06:00:14,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-14 06:00:14,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:14,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 153 conjunts are in the unsatisfiable core [2022-07-14 06:00:14,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:14,675 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-14 06:00:15,019 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 14 treesize of output 10 [2022-07-14 06:00:15,188 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 16 treesize of output 18 [2022-07-14 06:00:15,306 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 16 treesize of output 18 [2022-07-14 06:00:15,427 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 16 treesize of output 18 [2022-07-14 06:00:15,552 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 16 treesize of output 18 [2022-07-14 06:00:15,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 16 treesize of output 18 [2022-07-14 06:00:15,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:00:15,781 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:15,781 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 17 treesize of output 10 [2022-07-14 06:00:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:15,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:15,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-14 06:00:15,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:15,809 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_622) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:15,816 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:15,822 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_621) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:15,836 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:15,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_620) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:15,849 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:15,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_619) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:15,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:15,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:15,870 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:15,870 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 23 treesize of output 24 [2022-07-14 06:00:15,875 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:15,875 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 37 treesize of output 37 [2022-07-14 06:00:15,878 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 11 treesize of output 7 [2022-07-14 06:00:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 59 not checked. [2022-07-14 06:00:16,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765230344] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:16,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:16,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 24] total 69 [2022-07-14 06:00:16,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089643501] [2022-07-14 06:00:16,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:16,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-14 06:00:16,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:16,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-14 06:00:16,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=3127, Unknown=11, NotChecked=1342, Total=4692 [2022-07-14 06:00:16,255 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:17,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:17,542 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-07-14 06:00:17,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-14 06:00:17,542 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-07-14 06:00:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:17,542 INFO L225 Difference]: With dead ends: 94 [2022-07-14 06:00:17,542 INFO L226 Difference]: Without dead ends: 68 [2022-07-14 06:00:17,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 11 IntricatePredicates, 5 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=361, Invalid=5834, Unknown=11, NotChecked=1804, Total=8010 [2022-07-14 06:00:17,544 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 48 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 727 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:17,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 533 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 706 Invalid, 0 Unknown, 727 Unchecked, 0.3s Time] [2022-07-14 06:00:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-14 06:00:17,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-07-14 06:00:17,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 64 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-14 06:00:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2022-07-14 06:00:17,546 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 54 [2022-07-14 06:00:17,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:17,546 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2022-07-14 06:00:17,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:17,547 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-07-14 06:00:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 06:00:17,547 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:17,547 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:17,565 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-14 06:00:17,756 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,SelfDestructingSolverStorable27 [2022-07-14 06:00:17,756 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:00:17,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:17,757 INFO L85 PathProgramCache]: Analyzing trace with hash -101124877, now seen corresponding path program 10 times [2022-07-14 06:00:17,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:17,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957195251] [2022-07-14 06:00:17,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:17,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:17,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:18,063 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 28 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:18,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:18,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957195251] [2022-07-14 06:00:18,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957195251] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:18,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241383412] [2022-07-14 06:00:18,064 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 06:00:18,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:18,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:18,065 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-14 06:00:18,066 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-14 06:00:18,163 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 06:00:18,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:18,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-14 06:00:18,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:18,177 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-14 06:00:18,184 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-14 06:00:18,474 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 16 treesize of output 12 [2022-07-14 06:00:18,633 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 18 treesize of output 20 [2022-07-14 06:00:18,747 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 18 treesize of output 20 [2022-07-14 06:00:18,853 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 18 treesize of output 20 [2022-07-14 06:00:18,958 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 18 treesize of output 20 [2022-07-14 06:00:19,069 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 18 treesize of output 20 [2022-07-14 06:00:19,166 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:19,166 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 21 treesize of output 21 [2022-07-14 06:00:19,290 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:19,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:20,137 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_696 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121| Int)) (or (<= (+ 7 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) 0) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-14 06:00:20,148 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_696 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121| Int)) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) (<= (+ 7 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) 0))) is different from false [2022-07-14 06:00:20,154 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:20,155 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 23 treesize of output 24 [2022-07-14 06:00:20,161 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:20,162 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 37 treesize of output 37 [2022-07-14 06:00:20,165 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 11 treesize of output 7 [2022-07-14 06:00:21,212 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-14 06:00:21,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241383412] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:21,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:21,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 25] total 66 [2022-07-14 06:00:21,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467511282] [2022-07-14 06:00:21,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:21,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-14 06:00:21,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:21,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-14 06:00:21,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=3727, Unknown=6, NotChecked=254, Total=4422 [2022-07-14 06:00:21,218 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 67 states, 66 states have (on average 2.515151515151515) internal successors, (166), 67 states have internal predecessors, (166), 0 states have call successors, (0), 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-14 06:00:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:23,437 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2022-07-14 06:00:23,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-14 06:00:23,438 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 2.515151515151515) internal successors, (166), 67 states have internal predecessors, (166), 0 states have call successors, (0), 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 58 [2022-07-14 06:00:23,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:23,438 INFO L225 Difference]: With dead ends: 68 [2022-07-14 06:00:23,439 INFO L226 Difference]: Without dead ends: 68 [2022-07-14 06:00:23,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1363 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1144, Invalid=6827, Unknown=47, NotChecked=354, Total=8372 [2022-07-14 06:00:23,441 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 111 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 448 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:23,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 361 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 780 Invalid, 0 Unknown, 448 Unchecked, 0.4s Time] [2022-07-14 06:00:23,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-14 06:00:23,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-14 06:00:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 67 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-14 06:00:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2022-07-14 06:00:23,444 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 58 [2022-07-14 06:00:23,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:23,444 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2022-07-14 06:00:23,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 2.515151515151515) internal successors, (166), 67 states have internal predecessors, (166), 0 states have call successors, (0), 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-14 06:00:23,444 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-07-14 06:00:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-14 06:00:23,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:23,445 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:23,471 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-14 06:00:23,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:23,654 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:00:23,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:23,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2106334426, now seen corresponding path program 4 times [2022-07-14 06:00:23,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:23,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496377226] [2022-07-14 06:00:23,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:23,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:23,964 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 85 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:23,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:23,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496377226] [2022-07-14 06:00:23,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496377226] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:23,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503356956] [2022-07-14 06:00:23,964 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 06:00:23,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:23,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:23,980 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-14 06:00:23,983 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-14 06:00:24,104 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 06:00:24,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:24,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-14 06:00:24,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:24,123 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:00:24,123 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-14 06:00:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 92 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:24,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 91 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:25,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503356956] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:25,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:25,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 47 [2022-07-14 06:00:25,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024278803] [2022-07-14 06:00:25,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:25,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-14 06:00:25,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:25,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-14 06:00:25,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=1803, Unknown=0, NotChecked=0, Total=2162 [2022-07-14 06:00:25,007 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 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-14 06:00:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:25,546 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2022-07-14 06:00:25,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 06:00:25,547 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 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 63 [2022-07-14 06:00:25,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:25,547 INFO L225 Difference]: With dead ends: 107 [2022-07-14 06:00:25,547 INFO L226 Difference]: Without dead ends: 75 [2022-07-14 06:00:25,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=859, Invalid=3173, Unknown=0, NotChecked=0, Total=4032 [2022-07-14 06:00:25,549 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 80 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:25,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 120 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:00:25,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-14 06:00:25,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-07-14 06:00:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 70 states have (on average 1.042857142857143) internal successors, (73), 71 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-14 06:00:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2022-07-14 06:00:25,551 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 63 [2022-07-14 06:00:25,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:25,552 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-07-14 06:00:25,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 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-14 06:00:25,552 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2022-07-14 06:00:25,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-14 06:00:25,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:25,552 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:25,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-14 06:00:25,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:25,753 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:00:25,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:25,754 INFO L85 PathProgramCache]: Analyzing trace with hash 717029661, now seen corresponding path program 5 times [2022-07-14 06:00:25,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:25,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073094723] [2022-07-14 06:00:25,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:25,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 45 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:26,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:26,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073094723] [2022-07-14 06:00:26,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073094723] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:26,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169492756] [2022-07-14 06:00:26,069 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 06:00:26,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:26,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:26,071 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-14 06:00:26,072 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-14 06:00:26,280 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-07-14 06:00:26,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:26,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 98 conjunts are in the unsatisfiable core [2022-07-14 06:00:26,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:26,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:00:26,303 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-14 06:00:26,305 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-14 06:00:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 66 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:26,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:27,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169492756] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:27,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:27,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 52 [2022-07-14 06:00:27,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283359812] [2022-07-14 06:00:27,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:27,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-14 06:00:27,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:27,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-14 06:00:27,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2413, Unknown=0, NotChecked=0, Total=2756 [2022-07-14 06:00:27,406 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 53 states, 52 states have (on average 3.5961538461538463) internal successors, (187), 53 states have internal predecessors, (187), 0 states have call successors, (0), 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-14 06:00:28,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:28,071 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-07-14 06:00:28,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 06:00:28,072 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 3.5961538461538463) internal successors, (187), 53 states have internal predecessors, (187), 0 states have call successors, (0), 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 67 [2022-07-14 06:00:28,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:28,072 INFO L225 Difference]: With dead ends: 74 [2022-07-14 06:00:28,072 INFO L226 Difference]: Without dead ends: 74 [2022-07-14 06:00:28,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=913, Invalid=4057, Unknown=0, NotChecked=0, Total=4970 [2022-07-14 06:00:28,073 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 80 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:28,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 276 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:00:28,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-14 06:00:28,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-07-14 06:00:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 72 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-14 06:00:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2022-07-14 06:00:28,074 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 67 [2022-07-14 06:00:28,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:28,074 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2022-07-14 06:00:28,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.5961538461538463) internal successors, (187), 53 states have internal predecessors, (187), 0 states have call successors, (0), 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-14 06:00:28,075 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2022-07-14 06:00:28,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 06:00:28,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:28,075 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:28,109 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-14 06:00:28,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:28,276 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:00:28,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:28,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2136703776, now seen corresponding path program 11 times [2022-07-14 06:00:28,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:28,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198207258] [2022-07-14 06:00:28,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:28,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:28,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:28,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198207258] [2022-07-14 06:00:28,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198207258] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:28,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584647553] [2022-07-14 06:00:28,994 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 06:00:28,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:28,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:28,995 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-14 06:00:28,996 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-14 06:00:29,455 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-07-14 06:00:29,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:29,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 145 conjunts are in the unsatisfiable core [2022-07-14 06:00:29,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:29,469 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-14 06:00:29,866 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 14 treesize of output 10 [2022-07-14 06:00:30,022 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 17 treesize of output 19 [2022-07-14 06:00:30,087 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 16 treesize of output 18 [2022-07-14 06:00:30,133 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 16 treesize of output 18 [2022-07-14 06:00:30,182 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 16 treesize of output 18 [2022-07-14 06:00:30,230 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 16 treesize of output 18 [2022-07-14 06:00:30,279 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 16 treesize of output 18 [2022-07-14 06:00:30,291 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-14 06:00:30,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:00:30,299 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:30,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:30,308 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-14 06:00:30,312 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:30,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_923 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_922) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:30,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:30,327 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_921) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:30,332 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:30,338 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_923 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_920) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:30,343 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:30,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int)) (v_ArrVal_919 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_919) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:30,353 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:30,377 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_918) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:30,382 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:30,387 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int)) (v_ArrVal_917 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_917) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:30,393 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:30,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 7 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:30,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:30,400 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 23 treesize of output 24 [2022-07-14 06:00:30,405 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:30,405 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 37 treesize of output 37 [2022-07-14 06:00:30,408 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 11 treesize of output 7 [2022-07-14 06:00:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 111 not checked. [2022-07-14 06:00:30,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584647553] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:30,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:30,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30, 30] total 72 [2022-07-14 06:00:30,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941199169] [2022-07-14 06:00:30,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:30,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-14 06:00:30,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:30,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-14 06:00:30,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=3037, Unknown=15, NotChecked=1860, Total=5112 [2022-07-14 06:00:30,643 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 72 states, 72 states have (on average 2.1666666666666665) internal successors, (156), 72 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:32,023 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2022-07-14 06:00:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-14 06:00:32,023 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.1666666666666665) internal successors, (156), 72 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-07-14 06:00:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:32,023 INFO L225 Difference]: With dead ends: 114 [2022-07-14 06:00:32,024 INFO L226 Difference]: Without dead ends: 80 [2022-07-14 06:00:32,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 101 SyntacticMatches, 16 SemanticMatches, 86 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=299, Invalid=5002, Unknown=15, NotChecked=2340, Total=7656 [2022-07-14 06:00:32,024 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 45 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1207 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:32,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 678 Invalid, 2540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1305 Invalid, 0 Unknown, 1207 Unchecked, 0.5s Time] [2022-07-14 06:00:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-14 06:00:32,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2022-07-14 06:00:32,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.04) internal successors, (78), 76 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-14 06:00:32,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-07-14 06:00:32,026 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 70 [2022-07-14 06:00:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:32,026 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-07-14 06:00:32,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.1666666666666665) internal successors, (156), 72 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:32,027 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-07-14 06:00:32,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-14 06:00:32,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:32,027 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:32,045 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-14 06:00:32,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:32,235 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:00:32,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:32,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1499060029, now seen corresponding path program 12 times [2022-07-14 06:00:32,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:32,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431039268] [2022-07-14 06:00:32,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:32,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 66 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:32,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:32,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431039268] [2022-07-14 06:00:32,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431039268] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:32,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046637093] [2022-07-14 06:00:32,529 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 06:00:32,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:32,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:32,530 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-14 06:00:32,539 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-14 06:00:33,114 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-07-14 06:00:33,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:33,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-14 06:00:33,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:33,132 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:00:33,132 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-14 06:00:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 91 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:33,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:34,750 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 120 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:34,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046637093] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:34,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:34,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 61 [2022-07-14 06:00:34,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846316124] [2022-07-14 06:00:34,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:34,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-07-14 06:00:34,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:34,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-07-14 06:00:34,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=3314, Unknown=0, NotChecked=0, Total=3782 [2022-07-14 06:00:34,752 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 62 states, 61 states have (on average 3.5081967213114753) internal successors, (214), 62 states have internal predecessors, (214), 0 states have call successors, (0), 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-14 06:00:36,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:36,072 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2022-07-14 06:00:36,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-14 06:00:36,073 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 3.5081967213114753) internal successors, (214), 62 states have internal predecessors, (214), 0 states have call successors, (0), 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 74 [2022-07-14 06:00:36,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:36,073 INFO L225 Difference]: With dead ends: 83 [2022-07-14 06:00:36,073 INFO L226 Difference]: Without dead ends: 83 [2022-07-14 06:00:36,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1560, Invalid=6272, Unknown=0, NotChecked=0, Total=7832 [2022-07-14 06:00:36,074 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 319 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:36,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 236 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:00:36,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-14 06:00:36,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2022-07-14 06:00:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 79 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-14 06:00:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2022-07-14 06:00:36,076 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 74 [2022-07-14 06:00:36,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:36,076 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2022-07-14 06:00:36,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 3.5081967213114753) internal successors, (214), 62 states have internal predecessors, (214), 0 states have call successors, (0), 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-14 06:00:36,076 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-07-14 06:00:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-14 06:00:36,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:36,077 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:36,096 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-14 06:00:36,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:36,290 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:00:36,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:36,291 INFO L85 PathProgramCache]: Analyzing trace with hash -773779368, now seen corresponding path program 6 times [2022-07-14 06:00:36,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:36,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780179141] [2022-07-14 06:00:36,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:36,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:36,782 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 66 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:36,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:36,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780179141] [2022-07-14 06:00:36,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780179141] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:36,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874501815] [2022-07-14 06:00:36,783 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 06:00:36,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:36,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:36,791 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-14 06:00:36,797 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-14 06:00:37,365 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-07-14 06:00:37,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:37,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-14 06:00:37,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:37,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:00:37,382 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-14 06:00:37,384 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-14 06:00:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 91 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:38,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:38,940 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:38,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874501815] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:38,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:38,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 62 [2022-07-14 06:00:38,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348723284] [2022-07-14 06:00:38,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:38,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-14 06:00:38,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:38,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-14 06:00:38,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=3426, Unknown=0, NotChecked=0, Total=3906 [2022-07-14 06:00:38,942 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 63 states, 62 states have (on average 3.5) internal successors, (217), 63 states have internal predecessors, (217), 0 states have call successors, (0), 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-14 06:00:40,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:40,421 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-07-14 06:00:40,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-14 06:00:40,422 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 3.5) internal successors, (217), 63 states have internal predecessors, (217), 0 states have call successors, (0), 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 75 [2022-07-14 06:00:40,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:40,423 INFO L225 Difference]: With dead ends: 82 [2022-07-14 06:00:40,423 INFO L226 Difference]: Without dead ends: 82 [2022-07-14 06:00:40,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1417 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1573, Invalid=6437, Unknown=0, NotChecked=0, Total=8010 [2022-07-14 06:00:40,432 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 415 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:40,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 214 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:00:40,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-14 06:00:40,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-07-14 06:00:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 80 states have internal predecessors, (82), 0 states have call successors, (0), 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-14 06:00:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2022-07-14 06:00:40,433 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 75 [2022-07-14 06:00:40,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:40,434 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2022-07-14 06:00:40,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 3.5) internal successors, (217), 63 states have internal predecessors, (217), 0 states have call successors, (0), 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-14 06:00:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2022-07-14 06:00:40,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-14 06:00:40,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:40,435 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:40,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-14 06:00:40,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:40,646 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:00:40,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:40,646 INFO L85 PathProgramCache]: Analyzing trace with hash -571678779, now seen corresponding path program 13 times [2022-07-14 06:00:40,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:40,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294648949] [2022-07-14 06:00:40,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:40,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:41,525 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:41,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:41,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294648949] [2022-07-14 06:00:41,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294648949] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:41,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057634511] [2022-07-14 06:00:41,526 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-14 06:00:41,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:41,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:41,528 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:00:41,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-14 06:00:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:41,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 162 conjunts are in the unsatisfiable core [2022-07-14 06:00:41,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:41,668 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-14 06:00:42,054 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 14 treesize of output 10 [2022-07-14 06:00:42,224 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 17 treesize of output 19 [2022-07-14 06:00:42,295 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 16 treesize of output 18 [2022-07-14 06:00:42,359 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 16 treesize of output 18 [2022-07-14 06:00:42,408 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 16 treesize of output 18 [2022-07-14 06:00:42,458 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 16 treesize of output 18 [2022-07-14 06:00:42,521 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 16 treesize of output 18 [2022-07-14 06:00:42,591 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 16 treesize of output 18 [2022-07-14 06:00:42,646 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-14 06:00:42,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:00:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:42,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:42,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-14 06:00:42,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:42,716 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1176) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:42,722 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:42,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1175 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1175) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:42,738 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:42,743 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1174 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1174) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:42,749 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:42,755 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1173) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:42,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:42,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1172) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:42,771 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:42,777 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1171) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:42,786 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:42,792 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1177 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1170) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:42,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:42,802 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:42,806 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:42,807 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 23 treesize of output 24 [2022-07-14 06:00:42,812 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:42,813 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 37 treesize of output 37 [2022-07-14 06:00:42,815 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 11 treesize of output 7 [2022-07-14 06:00:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 143 not checked. [2022-07-14 06:00:43,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057634511] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:43,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:43,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 33, 33] total 82 [2022-07-14 06:00:43,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192239731] [2022-07-14 06:00:43,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:43,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-07-14 06:00:43,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:43,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-07-14 06:00:43,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3981, Unknown=17, NotChecked=2414, Total=6642 [2022-07-14 06:00:43,239 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 82 states, 82 states have (on average 2.1707317073170733) internal successors, (178), 82 states have internal predecessors, (178), 0 states have call successors, (0), 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-14 06:00:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:45,293 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2022-07-14 06:00:45,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-14 06:00:45,293 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 2.1707317073170733) internal successors, (178), 82 states have internal predecessors, (178), 0 states have call successors, (0), 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 78 [2022-07-14 06:00:45,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:45,294 INFO L225 Difference]: With dead ends: 126 [2022-07-14 06:00:45,294 INFO L226 Difference]: Without dead ends: 88 [2022-07-14 06:00:45,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 106 SyntacticMatches, 25 SemanticMatches, 100 ConstructedPredicates, 17 IntricatePredicates, 1 DeprecatedPredicates, 2001 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=354, Invalid=6837, Unknown=17, NotChecked=3094, Total=10302 [2022-07-14 06:00:45,295 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 54 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 3045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1415 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:45,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 803 Invalid, 3045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1590 Invalid, 0 Unknown, 1415 Unchecked, 0.6s Time] [2022-07-14 06:00:45,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-14 06:00:45,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2022-07-14 06:00:45,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 83 states have (on average 1.036144578313253) internal successors, (86), 84 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-14 06:00:45,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2022-07-14 06:00:45,297 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 78 [2022-07-14 06:00:45,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:45,297 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2022-07-14 06:00:45,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 2.1707317073170733) internal successors, (178), 82 states have internal predecessors, (178), 0 states have call successors, (0), 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-14 06:00:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-07-14 06:00:45,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-14 06:00:45,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:45,299 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:45,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-14 06:00:45,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-14 06:00:45,511 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:00:45,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:45,512 INFO L85 PathProgramCache]: Analyzing trace with hash 495226146, now seen corresponding path program 14 times [2022-07-14 06:00:45,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:45,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150358679] [2022-07-14 06:00:45,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 91 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:45,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:45,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150358679] [2022-07-14 06:00:45,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150358679] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:45,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58496609] [2022-07-14 06:00:45,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:00:45,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:45,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:45,917 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:00:45,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-14 06:00:46,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:00:46,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:46,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 102 conjunts are in the unsatisfiable core [2022-07-14 06:00:46,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:46,072 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:00:46,072 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-14 06:00:46,928 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 120 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:46,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:47,939 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 153 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:47,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58496609] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:47,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:47,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 67 [2022-07-14 06:00:47,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104635631] [2022-07-14 06:00:47,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:47,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-07-14 06:00:47,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:47,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-07-14 06:00:47,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=4072, Unknown=0, NotChecked=0, Total=4556 [2022-07-14 06:00:47,940 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 68 states, 67 states have (on average 3.5522388059701493) internal successors, (238), 68 states have internal predecessors, (238), 0 states have call successors, (0), 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-14 06:00:49,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:49,628 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2022-07-14 06:00:49,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-14 06:00:49,629 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 3.5522388059701493) internal successors, (238), 68 states have internal predecessors, (238), 0 states have call successors, (0), 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 82 [2022-07-14 06:00:49,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:49,629 INFO L225 Difference]: With dead ends: 91 [2022-07-14 06:00:49,629 INFO L226 Difference]: Without dead ends: 91 [2022-07-14 06:00:49,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1911 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1706, Invalid=7800, Unknown=0, NotChecked=0, Total=9506 [2022-07-14 06:00:49,630 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 354 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:49,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 432 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 06:00:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-14 06:00:49,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2022-07-14 06:00:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 87 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:00:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2022-07-14 06:00:49,632 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 82 [2022-07-14 06:00:49,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:49,632 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-07-14 06:00:49,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 3.5522388059701493) internal successors, (238), 68 states have internal predecessors, (238), 0 states have call successors, (0), 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-14 06:00:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2022-07-14 06:00:49,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-14 06:00:49,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:49,633 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:49,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-07-14 06:00:49,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-14 06:00:49,844 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:00:49,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:49,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1827858669, now seen corresponding path program 7 times [2022-07-14 06:00:49,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:49,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349963144] [2022-07-14 06:00:49,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:49,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 91 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:50,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:50,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349963144] [2022-07-14 06:00:50,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349963144] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:50,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699621214] [2022-07-14 06:00:50,293 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-14 06:00:50,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:50,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:50,296 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:00:50,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-14 06:00:50,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:50,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 111 conjunts are in the unsatisfiable core [2022-07-14 06:00:50,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:50,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:00:50,521 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-14 06:00:50,524 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-14 06:00:51,429 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 120 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:51,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:52,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699621214] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:52,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:52,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 68 [2022-07-14 06:00:52,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443137852] [2022-07-14 06:00:52,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:52,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-14 06:00:52,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:52,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-14 06:00:52,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=4196, Unknown=0, NotChecked=0, Total=4692 [2022-07-14 06:00:52,458 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 69 states, 68 states have (on average 3.5441176470588234) internal successors, (241), 69 states have internal predecessors, (241), 0 states have call successors, (0), 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-14 06:00:54,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:00:54,228 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-07-14 06:00:54,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-14 06:00:54,228 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 3.5441176470588234) internal successors, (241), 69 states have internal predecessors, (241), 0 states have call successors, (0), 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 83 [2022-07-14 06:00:54,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:00:54,229 INFO L225 Difference]: With dead ends: 90 [2022-07-14 06:00:54,229 INFO L226 Difference]: Without dead ends: 90 [2022-07-14 06:00:54,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1719, Invalid=7983, Unknown=0, NotChecked=0, Total=9702 [2022-07-14 06:00:54,230 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 568 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:00:54,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 378 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 06:00:54,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-14 06:00:54,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-07-14 06:00:54,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 87 states have (on average 1.0344827586206897) internal successors, (90), 88 states have internal predecessors, (90), 0 states have call successors, (0), 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-14 06:00:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2022-07-14 06:00:54,231 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 83 [2022-07-14 06:00:54,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:00:54,232 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2022-07-14 06:00:54,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 3.5441176470588234) internal successors, (241), 69 states have internal predecessors, (241), 0 states have call successors, (0), 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-14 06:00:54,232 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-07-14 06:00:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-14 06:00:54,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:00:54,232 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:00:54,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-14 06:00:54,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-14 06:00:54,433 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:00:54,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:00:54,433 INFO L85 PathProgramCache]: Analyzing trace with hash -2142233814, now seen corresponding path program 15 times [2022-07-14 06:00:54,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:00:54,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783948811] [2022-07-14 06:00:54,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:00:54,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:00:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:00:55,498 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 20 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:55,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:00:55,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783948811] [2022-07-14 06:00:55,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783948811] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:00:55,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491945021] [2022-07-14 06:00:55,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:00:55,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:00:55,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:00:55,500 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:00:55,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-14 06:00:56,617 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-14 06:00:56,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:00:56,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 229 conjunts are in the unsatisfiable core [2022-07-14 06:00:56,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:00:56,634 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-14 06:00:57,300 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 14 treesize of output 10 [2022-07-14 06:00:57,510 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 16 treesize of output 18 [2022-07-14 06:00:57,660 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 16 treesize of output 18 [2022-07-14 06:00:57,827 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 16 treesize of output 18 [2022-07-14 06:00:57,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:00:58,147 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 16 treesize of output 18 [2022-07-14 06:00:58,308 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 16 treesize of output 18 [2022-07-14 06:00:58,471 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 16 treesize of output 18 [2022-07-14 06:00:58,621 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 16 treesize of output 18 [2022-07-14 06:00:58,784 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 16 treesize of output 18 [2022-07-14 06:00:58,922 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:00:58,923 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:58,924 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 17 treesize of output 10 [2022-07-14 06:00:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 20 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:00:58,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:00:58,936 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-14 06:00:58,941 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:58,950 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1456) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:58,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:58,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1455 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1455) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:58,970 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:58,977 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1454) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-14 06:00:58,984 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:58,990 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1453) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:58,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:59,003 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1452) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:59,009 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:59,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1451) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:59,020 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:59,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1450 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1450) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:59,036 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:59,042 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1457 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1449) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:59,048 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:59,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 06:00:59,057 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:59,057 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 23 treesize of output 24 [2022-07-14 06:00:59,063 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:00:59,064 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 37 treesize of output 37 [2022-07-14 06:00:59,067 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 11 treesize of output 7 [2022-07-14 06:00:59,820 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 20 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 179 not checked. [2022-07-14 06:00:59,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491945021] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:00:59,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:00:59,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 36, 36] total 109 [2022-07-14 06:00:59,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100438443] [2022-07-14 06:00:59,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:00:59,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2022-07-14 06:00:59,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:00:59,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2022-07-14 06:00:59,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=7735, Unknown=19, NotChecked=3686, Total=11772 [2022-07-14 06:00:59,823 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 109 states, 109 states have (on average 2.1926605504587156) internal successors, (239), 109 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 06:01:02,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:01:02,068 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2022-07-14 06:01:02,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-14 06:01:02,069 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 2.1926605504587156) internal successors, (239), 109 states have internal predecessors, (239), 0 states have call successors, (0), 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 86 [2022-07-14 06:01:02,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:01:02,069 INFO L225 Difference]: With dead ends: 138 [2022-07-14 06:01:02,069 INFO L226 Difference]: Without dead ends: 96 [2022-07-14 06:01:02,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 115 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 19 IntricatePredicates, 6 DeprecatedPredicates, 3987 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=533, Invalid=13566, Unknown=19, NotChecked=4788, Total=18906 [2022-07-14 06:01:02,070 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 3556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2070 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:01:02,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1357 Invalid, 3556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1470 Invalid, 0 Unknown, 2070 Unchecked, 0.5s Time] [2022-07-14 06:01:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-14 06:01:02,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2022-07-14 06:01:02,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.032967032967033) internal successors, (94), 92 states have internal predecessors, (94), 0 states have call successors, (0), 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-14 06:01:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2022-07-14 06:01:02,072 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 86 [2022-07-14 06:01:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:01:02,072 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2022-07-14 06:01:02,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 2.1926605504587156) internal successors, (239), 109 states have internal predecessors, (239), 0 states have call successors, (0), 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-14 06:01:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-07-14 06:01:02,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-14 06:01:02,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:01:02,073 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:01:02,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-14 06:01:02,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:01:02,287 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:01:02,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:01:02,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1422334855, now seen corresponding path program 16 times [2022-07-14 06:01:02,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:01:02,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697148882] [2022-07-14 06:01:02,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:01:02,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:01:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:01:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 120 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:02,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:01:02,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697148882] [2022-07-14 06:01:02,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697148882] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:01:02,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047614911] [2022-07-14 06:01:02,692 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 06:01:02,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:01:02,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:01:02,694 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:01:02,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-14 06:01:02,857 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 06:01:02,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:01:02,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 174 conjunts are in the unsatisfiable core [2022-07-14 06:01:02,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:01:02,873 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:01:02,874 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-14 06:01:02,879 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-14 06:01:03,386 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 16 treesize of output 12 [2022-07-14 06:01:03,613 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 21 [2022-07-14 06:01:03,745 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 21 [2022-07-14 06:01:03,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, 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 21 [2022-07-14 06:01:04,031 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 21 [2022-07-14 06:01:04,199 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 21 [2022-07-14 06:01:04,398 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 21 [2022-07-14 06:01:04,608 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 21 [2022-07-14 06:01:04,801 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 21 [2022-07-14 06:01:04,996 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 21 [2022-07-14 06:01:05,171 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:01:05,172 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 22 treesize of output 22 [2022-07-14 06:01:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 162 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:05,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:01:07,326 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1565 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311| Int)) (or (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (<= (+ 11 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|)) 0))) is different from false [2022-07-14 06:01:07,337 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1565 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|)) 0) (<= (+ 11 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|))) is different from false [2022-07-14 06:01:07,344 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:01:07,344 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 23 treesize of output 24 [2022-07-14 06:01:07,350 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:01:07,351 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 37 treesize of output 37 [2022-07-14 06:01:07,355 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 11 treesize of output 7 [2022-07-14 06:01:09,294 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 190 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-14 06:01:09,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047614911] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:01:09,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:01:09,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 37, 37] total 98 [2022-07-14 06:01:09,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202550907] [2022-07-14 06:01:09,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:01:09,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2022-07-14 06:01:09,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:01:09,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2022-07-14 06:01:09,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=881, Invalid=8427, Unknown=12, NotChecked=382, Total=9702 [2022-07-14 06:01:09,311 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 99 states, 98 states have (on average 2.673469387755102) internal successors, (262), 99 states have internal predecessors, (262), 0 states have call successors, (0), 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-14 06:01:12,782 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse1 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (and (= (+ |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (or (and (<= 0 .cse0) (<= (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse1)) (forall ((v_ArrVal_1565 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1565) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0))) (= |c_ULTIMATE.start_cstrcpy_#t~post3#1.base| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (exists ((|ULTIMATE.start_main_~nondetString~0#1.offset| Int)) (let ((.cse2 (select |c_#length| |c_ULTIMATE.start_cstrcpy_#t~post3#1.base|))) (and (<= (+ |ULTIMATE.start_main_~nondetString~0#1.offset| 10) .cse2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post3#1.base|) (+ (- 1) .cse2 |ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset| (+ 9 |ULTIMATE.start_main_~nondetString~0#1.offset|))))) (<= .cse0 .cse1) (<= 9 |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset|))) is different from false [2022-07-14 06:01:13,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:01:13,156 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-07-14 06:01:13,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-14 06:01:13,157 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 98 states have (on average 2.673469387755102) internal successors, (262), 99 states have internal predecessors, (262), 0 states have call successors, (0), 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 90 [2022-07-14 06:01:13,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:01:13,157 INFO L225 Difference]: With dead ends: 101 [2022-07-14 06:01:13,157 INFO L226 Difference]: Without dead ends: 101 [2022-07-14 06:01:13,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3973 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1891, Invalid=18097, Unknown=46, NotChecked=846, Total=20880 [2022-07-14 06:01:13,159 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 95 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 982 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:01:13,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 719 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 629 Invalid, 0 Unknown, 982 Unchecked, 0.3s Time] [2022-07-14 06:01:13,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-14 06:01:13,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2022-07-14 06:01:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 99 states have internal predecessors, (102), 0 states have call successors, (0), 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-14 06:01:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-07-14 06:01:13,160 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 90 [2022-07-14 06:01:13,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:01:13,161 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-07-14 06:01:13,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 98 states have (on average 2.673469387755102) internal successors, (262), 99 states have internal predecessors, (262), 0 states have call successors, (0), 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-14 06:01:13,161 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-07-14 06:01:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-14 06:01:13,161 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:01:13,161 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:01:13,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-14 06:01:13,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-14 06:01:13,362 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:01:13,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:01:13,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1142707534, now seen corresponding path program 8 times [2022-07-14 06:01:13,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:01:13,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300925134] [2022-07-14 06:01:13,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:01:13,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:01:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:01:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 120 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:13,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:01:13,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300925134] [2022-07-14 06:01:13,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300925134] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:01:13,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319630406] [2022-07-14 06:01:13,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:01:13,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:01:13,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:01:13,800 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:01:13,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-14 06:01:13,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:01:13,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:01:13,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-14 06:01:13,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:01:13,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:01:13,983 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-14 06:01:13,985 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-14 06:01:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 153 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:14,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:01:16,193 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:16,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319630406] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:01:16,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:01:16,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 74 [2022-07-14 06:01:16,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254275890] [2022-07-14 06:01:16,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:01:16,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-14 06:01:16,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:01:16,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-14 06:01:16,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=4969, Unknown=0, NotChecked=0, Total=5550 [2022-07-14 06:01:16,195 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand has 75 states, 74 states have (on average 3.581081081081081) internal successors, (265), 75 states have internal predecessors, (265), 0 states have call successors, (0), 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-14 06:01:18,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:01:18,208 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-07-14 06:01:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-14 06:01:18,209 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 3.581081081081081) internal successors, (265), 75 states have internal predecessors, (265), 0 states have call successors, (0), 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 91 [2022-07-14 06:01:18,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:01:18,209 INFO L225 Difference]: With dead ends: 100 [2022-07-14 06:01:18,209 INFO L226 Difference]: Without dead ends: 100 [2022-07-14 06:01:18,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2373 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2047, Invalid=9509, Unknown=0, NotChecked=0, Total=11556 [2022-07-14 06:01:18,211 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 401 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:01:18,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 571 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 06:01:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-14 06:01:18,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-14 06:01:18,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.030612244897959) internal successors, (101), 99 states have internal predecessors, (101), 0 states have call successors, (0), 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-14 06:01:18,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2022-07-14 06:01:18,213 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 91 [2022-07-14 06:01:18,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:01:18,213 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2022-07-14 06:01:18,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 3.581081081081081) internal successors, (265), 75 states have internal predecessors, (265), 0 states have call successors, (0), 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-14 06:01:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-07-14 06:01:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-14 06:01:18,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:01:18,214 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:01:18,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-14 06:01:18,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-14 06:01:18,423 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:01:18,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:01:18,424 INFO L85 PathProgramCache]: Analyzing trace with hash -2009926970, now seen corresponding path program 9 times [2022-07-14 06:01:18,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:01:18,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007113230] [2022-07-14 06:01:18,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:01:18,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:01:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:01:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 221 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:18,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:01:18,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007113230] [2022-07-14 06:01:18,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007113230] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:01:18,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419389640] [2022-07-14 06:01:18,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:01:18,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:01:18,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:01:18,868 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:01:18,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-14 06:01:20,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-07-14 06:01:20,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:01:20,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-14 06:01:20,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:01:20,476 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:01:20,476 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-14 06:01:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 242 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:21,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:01:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 242 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:22,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419389640] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:01:22,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:01:22,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 27] total 67 [2022-07-14 06:01:22,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171601024] [2022-07-14 06:01:22,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:01:22,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-14 06:01:22,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:01:22,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-14 06:01:22,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=759, Invalid=3663, Unknown=0, NotChecked=0, Total=4422 [2022-07-14 06:01:22,057 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 67 states, 67 states have (on average 3.4477611940298507) internal successors, (231), 67 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 06:01:22,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:01:22,682 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2022-07-14 06:01:22,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-14 06:01:22,682 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 3.4477611940298507) internal successors, (231), 67 states have internal predecessors, (231), 0 states have call successors, (0), 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 95 [2022-07-14 06:01:22,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:01:22,683 INFO L225 Difference]: With dead ends: 155 [2022-07-14 06:01:22,683 INFO L226 Difference]: Without dead ends: 107 [2022-07-14 06:01:22,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1313, Invalid=5329, Unknown=0, NotChecked=0, Total=6642 [2022-07-14 06:01:22,684 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 83 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:01:22,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 182 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:01:22,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-14 06:01:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2022-07-14 06:01:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 103 states have internal predecessors, (105), 0 states have call successors, (0), 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-14 06:01:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2022-07-14 06:01:22,686 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 95 [2022-07-14 06:01:22,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:01:22,686 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2022-07-14 06:01:22,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 3.4477611940298507) internal successors, (231), 67 states have internal predecessors, (231), 0 states have call successors, (0), 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-14 06:01:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-07-14 06:01:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-14 06:01:22,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:01:22,687 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:01:22,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-14 06:01:22,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-07-14 06:01:22,893 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:01:22,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:01:22,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2008413431, now seen corresponding path program 10 times [2022-07-14 06:01:22,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:01:22,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033597204] [2022-07-14 06:01:22,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:01:22,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:01:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:01:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 153 proven. 331 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:23,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:01:23,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033597204] [2022-07-14 06:01:23,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033597204] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:01:23,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170533073] [2022-07-14 06:01:23,446 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 06:01:23,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:01:23,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:01:23,448 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:01:23,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-14 06:01:23,622 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 06:01:23,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:01:23,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 194 conjunts are in the unsatisfiable core [2022-07-14 06:01:23,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:01:23,649 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:01:23,649 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-14 06:01:23,658 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-14 06:01:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-07-14 06:01:24,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:01:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-07-14 06:01:26,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170533073] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:01:26,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:01:26,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18, 18] total 62 [2022-07-14 06:01:26,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179293342] [2022-07-14 06:01:26,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:01:26,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-14 06:01:26,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:01:26,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-14 06:01:26,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=3470, Unknown=0, NotChecked=0, Total=3906 [2022-07-14 06:01:26,059 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand has 63 states, 62 states have (on average 3.370967741935484) internal successors, (209), 63 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:01:32,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:01:32,533 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-07-14 06:01:32,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-07-14 06:01:32,533 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 3.370967741935484) internal successors, (209), 63 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-07-14 06:01:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:01:32,534 INFO L225 Difference]: With dead ends: 160 [2022-07-14 06:01:32,534 INFO L226 Difference]: Without dead ends: 160 [2022-07-14 06:01:32,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3372 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=3021, Invalid=14009, Unknown=0, NotChecked=0, Total=17030 [2022-07-14 06:01:32,535 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 404 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 2158 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:01:32,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 665 Invalid, 2318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2158 Invalid, 0 Unknown, 2 Unchecked, 1.0s Time] [2022-07-14 06:01:32,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-14 06:01:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 149. [2022-07-14 06:01:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 1.0952380952380953) internal successors, (161), 148 states have internal predecessors, (161), 0 states have call successors, (0), 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-14 06:01:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2022-07-14 06:01:32,538 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 99 [2022-07-14 06:01:32,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:01:32,538 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2022-07-14 06:01:32,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 3.370967741935484) internal successors, (209), 63 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:01:32,538 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-07-14 06:01:32,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-14 06:01:32,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:01:32,539 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:01:32,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-14 06:01:32,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:01:32,752 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:01:32,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:01:32,752 INFO L85 PathProgramCache]: Analyzing trace with hash 544873332, now seen corresponding path program 17 times [2022-07-14 06:01:32,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:01:32,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076589103] [2022-07-14 06:01:32,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:01:32,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:01:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:01:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 24 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:34,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:01:34,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076589103] [2022-07-14 06:01:34,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076589103] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:01:34,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075386759] [2022-07-14 06:01:34,299 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 06:01:34,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:01:34,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:01:34,301 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:01:34,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-14 06:01:35,408 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2022-07-14 06:01:35,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:01:35,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 205 conjunts are in the unsatisfiable core [2022-07-14 06:01:35,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:01:35,427 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-14 06:01:36,096 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 14 treesize of output 10 [2022-07-14 06:01:36,311 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 17 treesize of output 19 [2022-07-14 06:01:36,401 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 16 treesize of output 18 [2022-07-14 06:01:36,466 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 16 treesize of output 18 [2022-07-14 06:01:36,531 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 16 treesize of output 18 [2022-07-14 06:01:36,598 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 16 treesize of output 18 [2022-07-14 06:01:36,665 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 16 treesize of output 18 [2022-07-14 06:01:36,731 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 16 treesize of output 18 [2022-07-14 06:01:36,800 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 16 treesize of output 18 [2022-07-14 06:01:36,869 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 16 treesize of output 18 [2022-07-14 06:01:36,939 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 16 treesize of output 18 [2022-07-14 06:01:36,953 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-14 06:01:36,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:01:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 24 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:36,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:01:36,971 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-14 06:01:36,976 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:36,982 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1989) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-14 06:01:36,990 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:36,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1988) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:37,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:37,008 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1987) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:37,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:37,020 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1986) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:37,026 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:37,032 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1985) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:37,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:37,044 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1984) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:37,050 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:37,056 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1983) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:37,062 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:37,069 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1982) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:37,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:37,081 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1981) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:37,089 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:37,095 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1980) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:37,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:37,106 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 11)) 0)) is different from false [2022-07-14 06:01:37,111 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:01:37,112 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 23 treesize of output 24 [2022-07-14 06:01:37,117 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:01:37,118 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 37 treesize of output 37 [2022-07-14 06:01:37,121 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 11 treesize of output 7 [2022-07-14 06:01:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 24 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 263 not checked. [2022-07-14 06:01:37,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075386759] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:01:37,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:01:37,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 42, 42] total 104 [2022-07-14 06:01:37,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877509521] [2022-07-14 06:01:37,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:01:37,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-07-14 06:01:37,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:01:37,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-07-14 06:01:37,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=6261, Unknown=23, NotChecked=4140, Total=10712 [2022-07-14 06:01:37,708 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 104 states, 104 states have (on average 2.230769230769231) internal successors, (232), 104 states have internal predecessors, (232), 0 states have call successors, (0), 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-14 06:01:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:01:41,390 INFO L93 Difference]: Finished difference Result 206 states and 218 transitions. [2022-07-14 06:01:41,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-14 06:01:41,391 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 2.230769230769231) internal successors, (232), 104 states have internal predecessors, (232), 0 states have call successors, (0), 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 102 [2022-07-14 06:01:41,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:01:41,392 INFO L225 Difference]: With dead ends: 206 [2022-07-14 06:01:41,392 INFO L226 Difference]: Without dead ends: 156 [2022-07-14 06:01:41,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 144 SyntacticMatches, 41 SemanticMatches, 125 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 3275 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=427, Invalid=10354, Unknown=23, NotChecked=5198, Total=16002 [2022-07-14 06:01:41,393 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 50 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 2639 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 4747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2062 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:01:41,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1289 Invalid, 4747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2639 Invalid, 0 Unknown, 2062 Unchecked, 1.1s Time] [2022-07-14 06:01:41,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-14 06:01:41,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2022-07-14 06:01:41,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 151 states have (on average 1.0927152317880795) internal successors, (165), 152 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:01:41,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2022-07-14 06:01:41,397 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 102 [2022-07-14 06:01:41,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:01:41,398 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2022-07-14 06:01:41,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 2.230769230769231) internal successors, (232), 104 states have internal predecessors, (232), 0 states have call successors, (0), 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-14 06:01:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2022-07-14 06:01:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-14 06:01:41,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:01:41,398 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:01:41,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-07-14 06:01:41,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:01:41,599 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:01:41,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:01:41,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1957085649, now seen corresponding path program 18 times [2022-07-14 06:01:41,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:01:41,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276748319] [2022-07-14 06:01:41,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:01:41,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:01:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:01:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 190 proven. 374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:42,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:01:42,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276748319] [2022-07-14 06:01:42,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276748319] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:01:42,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312073671] [2022-07-14 06:01:42,116 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 06:01:42,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:01:42,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:01:42,164 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:01:42,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-14 06:01:46,063 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-07-14 06:01:46,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:01:46,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 111 conjunts are in the unsatisfiable core [2022-07-14 06:01:46,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:01:46,094 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:01:46,094 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-14 06:01:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 231 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:47,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:01:49,006 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 276 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:49,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312073671] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:01:49,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:01:49,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 85 [2022-07-14 06:01:49,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812233308] [2022-07-14 06:01:49,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:01:49,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-14 06:01:49,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:01:49,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-14 06:01:49,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=834, Invalid=6476, Unknown=0, NotChecked=0, Total=7310 [2022-07-14 06:01:49,019 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand has 86 states, 85 states have (on average 3.6470588235294117) internal successors, (310), 86 states have internal predecessors, (310), 0 states have call successors, (0), 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-14 06:01:51,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:01:51,692 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-07-14 06:01:51,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-14 06:01:51,692 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 3.6470588235294117) internal successors, (310), 86 states have internal predecessors, (310), 0 states have call successors, (0), 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 106 [2022-07-14 06:01:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:01:51,693 INFO L225 Difference]: With dead ends: 153 [2022-07-14 06:01:51,693 INFO L226 Difference]: Without dead ends: 153 [2022-07-14 06:01:51,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2845 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3022, Invalid=12478, Unknown=0, NotChecked=0, Total=15500 [2022-07-14 06:01:51,695 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 463 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:01:51,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 474 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 06:01:51,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-14 06:01:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-07-14 06:01:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 151 states have (on average 1.086092715231788) internal successors, (164), 152 states have internal predecessors, (164), 0 states have call successors, (0), 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-14 06:01:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2022-07-14 06:01:51,698 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 106 [2022-07-14 06:01:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:01:51,698 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2022-07-14 06:01:51,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 3.6470588235294117) internal successors, (310), 86 states have internal predecessors, (310), 0 states have call successors, (0), 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-14 06:01:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-07-14 06:01:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-14 06:01:51,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:01:51,699 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:01:51,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-14 06:01:51,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:01:51,900 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:01:51,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:01:51,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1557815385, now seen corresponding path program 19 times [2022-07-14 06:01:51,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:01:51,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110221810] [2022-07-14 06:01:51,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:01:51,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:01:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:01:53,651 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 26 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:53,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:01:53,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110221810] [2022-07-14 06:01:53,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110221810] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:01:53,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394887763] [2022-07-14 06:01:53,651 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-14 06:01:53,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:01:53,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:01:53,653 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:01:53,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-14 06:01:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:01:53,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 220 conjunts are in the unsatisfiable core [2022-07-14 06:01:53,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:01:53,871 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-14 06:01:54,597 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 14 treesize of output 10 [2022-07-14 06:01:54,831 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 17 treesize of output 19 [2022-07-14 06:01:54,925 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 16 treesize of output 18 [2022-07-14 06:01:54,993 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 16 treesize of output 18 [2022-07-14 06:01:55,061 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 16 treesize of output 18 [2022-07-14 06:01:55,135 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 16 treesize of output 18 [2022-07-14 06:01:55,204 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 16 treesize of output 18 [2022-07-14 06:01:55,274 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 16 treesize of output 18 [2022-07-14 06:01:55,346 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 16 treesize of output 18 [2022-07-14 06:01:55,418 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 16 treesize of output 18 [2022-07-14 06:01:55,488 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 16 treesize of output 18 [2022-07-14 06:01:55,564 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 16 treesize of output 18 [2022-07-14 06:01:55,579 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-14 06:01:55,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:01:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 26 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:01:55,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:01:55,598 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-14 06:01:55,605 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,613 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2231 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2231) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-14 06:01:55,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,624 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2230 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2230) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,636 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2229 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2229) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-14 06:01:55,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,653 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2228 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2228) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,659 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,664 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2227) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,670 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,676 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2226) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,683 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2225) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2224) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,707 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,713 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2223) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,726 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2222) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,752 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2221) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,758 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 06:01:55,768 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:01:55,768 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 23 treesize of output 24 [2022-07-14 06:01:55,773 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:01:55,773 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 37 treesize of output 37 [2022-07-14 06:01:55,776 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 11 treesize of output 7 [2022-07-14 06:01:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 26 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 311 not checked. [2022-07-14 06:01:56,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394887763] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:01:56,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:01:56,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 45, 45] total 112 [2022-07-14 06:01:56,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603337050] [2022-07-14 06:01:56,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:01:56,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-07-14 06:01:56,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:01:56,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-07-14 06:01:56,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=7247, Unknown=25, NotChecked=4850, Total=12432 [2022-07-14 06:01:56,425 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand has 112 states, 112 states have (on average 2.2410714285714284) internal successors, (251), 112 states have internal predecessors, (251), 0 states have call successors, (0), 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-14 06:02:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:02:00,739 INFO L93 Difference]: Finished difference Result 214 states and 225 transitions. [2022-07-14 06:02:00,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-14 06:02:00,740 INFO L78 Accepts]: Start accepts. Automaton has has 112 states, 112 states have (on average 2.2410714285714284) internal successors, (251), 112 states have internal predecessors, (251), 0 states have call successors, (0), 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 110 [2022-07-14 06:02:00,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:02:00,740 INFO L225 Difference]: With dead ends: 214 [2022-07-14 06:02:00,741 INFO L226 Difference]: Without dead ends: 160 [2022-07-14 06:02:00,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 154 SyntacticMatches, 39 SemanticMatches, 136 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 3693 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=464, Invalid=12267, Unknown=25, NotChecked=6150, Total=18906 [2022-07-14 06:02:00,742 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 56 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 4114 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 6839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 4114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2670 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:02:00,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1607 Invalid, 6839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 4114 Invalid, 0 Unknown, 2670 Unchecked, 1.6s Time] [2022-07-14 06:02:00,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-14 06:02:00,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2022-07-14 06:02:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.0838709677419356) internal successors, (168), 156 states have internal predecessors, (168), 0 states have call successors, (0), 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-14 06:02:00,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2022-07-14 06:02:00,747 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 110 [2022-07-14 06:02:00,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:02:00,747 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2022-07-14 06:02:00,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 2.2410714285714284) internal successors, (251), 112 states have internal predecessors, (251), 0 states have call successors, (0), 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-14 06:02:00,748 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-07-14 06:02:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-14 06:02:00,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:02:00,749 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:02:00,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-14 06:02:00,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-07-14 06:02:00,955 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:02:00,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:02:00,956 INFO L85 PathProgramCache]: Analyzing trace with hash 31283638, now seen corresponding path program 20 times [2022-07-14 06:02:00,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:02:00,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928104436] [2022-07-14 06:02:00,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:02:00,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:02:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:02:01,533 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 231 proven. 432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:02:01,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:02:01,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928104436] [2022-07-14 06:02:01,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928104436] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:02:01,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208441947] [2022-07-14 06:02:01,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:02:01,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:02:01,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:02:01,535 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:02:01,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-14 06:02:01,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:02:01,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:02:01,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-14 06:02:01,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:02:01,736 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:02:01,736 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-14 06:02:02,997 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 276 proven. 387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:02:02,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:02:04,564 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 325 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:02:04,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208441947] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:02:04,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:02:04,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 92 [2022-07-14 06:02:04,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514633296] [2022-07-14 06:02:04,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:02:04,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-07-14 06:02:04,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:02:04,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-07-14 06:02:04,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=970, Invalid=7586, Unknown=0, NotChecked=0, Total=8556 [2022-07-14 06:02:04,565 INFO L87 Difference]: Start difference. First operand 157 states and 168 transitions. Second operand has 93 states, 92 states have (on average 3.630434782608696) internal successors, (334), 93 states have internal predecessors, (334), 0 states have call successors, (0), 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-14 06:02:06,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:02:06,261 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2022-07-14 06:02:06,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-14 06:02:06,262 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 92 states have (on average 3.630434782608696) internal successors, (334), 93 states have internal predecessors, (334), 0 states have call successors, (0), 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 114 [2022-07-14 06:02:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:02:06,262 INFO L225 Difference]: With dead ends: 157 [2022-07-14 06:02:06,263 INFO L226 Difference]: Without dead ends: 157 [2022-07-14 06:02:06,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4180 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2618, Invalid=12388, Unknown=0, NotChecked=0, Total=15006 [2022-07-14 06:02:06,264 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 243 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 2063 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 2142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:02:06,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 668 Invalid, 2142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2063 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 06:02:06,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-14 06:02:06,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-07-14 06:02:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.0774193548387097) internal successors, (167), 156 states have internal predecessors, (167), 0 states have call successors, (0), 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-14 06:02:06,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2022-07-14 06:02:06,266 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 114 [2022-07-14 06:02:06,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:02:06,267 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2022-07-14 06:02:06,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 92 states have (on average 3.630434782608696) internal successors, (334), 93 states have internal predecessors, (334), 0 states have call successors, (0), 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-14 06:02:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2022-07-14 06:02:06,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-14 06:02:06,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:02:06,267 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:02:06,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-07-14 06:02:06,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:02:06,482 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:02:06,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:02:06,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1148682818, now seen corresponding path program 21 times [2022-07-14 06:02:06,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:02:06,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431981956] [2022-07-14 06:02:06,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:02:06,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:02:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:02:08,150 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 28 proven. 689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:02:08,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:02:08,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431981956] [2022-07-14 06:02:08,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431981956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:02:08,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285595067] [2022-07-14 06:02:08,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:02:08,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:02:08,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:02:08,151 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:02:08,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-14 06:02:14,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-07-14 06:02:14,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:02:14,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 307 conjunts are in the unsatisfiable core [2022-07-14 06:02:14,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:02:14,844 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-14 06:02:15,864 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 14 treesize of output 10 [2022-07-14 06:02:16,104 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 16 treesize of output 18 [2022-07-14 06:02:16,275 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 16 treesize of output 18 [2022-07-14 06:02:16,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 16 treesize of output 18 [2022-07-14 06:02:16,641 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 16 treesize of output 18 [2022-07-14 06:02:16,853 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 16 treesize of output 18 [2022-07-14 06:02:17,069 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 16 treesize of output 18 [2022-07-14 06:02:17,266 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 16 treesize of output 18 [2022-07-14 06:02:17,464 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 16 treesize of output 18 [2022-07-14 06:02:17,660 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 16 treesize of output 18 [2022-07-14 06:02:17,861 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 16 treesize of output 18 [2022-07-14 06:02:18,057 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 16 treesize of output 18 [2022-07-14 06:02:18,268 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 16 treesize of output 18 [2022-07-14 06:02:18,446 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 16 treesize of output 18 [2022-07-14 06:02:18,621 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:02:18,623 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:02:18,623 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 17 treesize of output 10 [2022-07-14 06:02:18,626 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 28 proven. 689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:02:18,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:02:18,633 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-14 06:02:18,665 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,670 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2490) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,675 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2489) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,685 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,690 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2488 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2488) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,699 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2487 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2487) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2486 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2486) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2485 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2485) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,724 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2484 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2484) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,734 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,740 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2483 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2483) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,746 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,751 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2482) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,762 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2481 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2481) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,767 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,772 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2480 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2480) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,777 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,782 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2479 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2479) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,787 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,791 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 13 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 06:02:18,795 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:02:18,795 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 23 treesize of output 24 [2022-07-14 06:02:18,799 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:02:18,799 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 37 treesize of output 37 [2022-07-14 06:02:18,801 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 11 treesize of output 7 [2022-07-14 06:02:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 28 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 363 not checked. [2022-07-14 06:02:19,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285595067] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:02:19,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:02:19,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 48, 48] total 149 [2022-07-14 06:02:19,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970569712] [2022-07-14 06:02:19,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:02:19,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2022-07-14 06:02:19,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:02:19,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2022-07-14 06:02:19,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=14391, Unknown=27, NotChecked=7182, Total=22052 [2022-07-14 06:02:19,875 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand has 149 states, 149 states have (on average 2.248322147651007) internal successors, (335), 149 states have internal predecessors, (335), 0 states have call successors, (0), 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-14 06:02:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:02:24,265 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2022-07-14 06:02:24,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-07-14 06:02:24,265 INFO L78 Accepts]: Start accepts. Automaton has has 149 states, 149 states have (on average 2.248322147651007) internal successors, (335), 149 states have internal predecessors, (335), 0 states have call successors, (0), 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 118 [2022-07-14 06:02:24,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:02:24,266 INFO L225 Difference]: With dead ends: 222 [2022-07-14 06:02:24,266 INFO L226 Difference]: Without dead ends: 164 [2022-07-14 06:02:24,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 148 SyntacticMatches, 13 SemanticMatches, 187 ConstructedPredicates, 27 IntricatePredicates, 13 DeprecatedPredicates, 7961 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=736, Invalid=25427, Unknown=27, NotChecked=9342, Total=35532 [2022-07-14 06:02:24,268 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 56 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 4943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2591 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:02:24,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 2094 Invalid, 4943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2335 Invalid, 0 Unknown, 2591 Unchecked, 0.9s Time] [2022-07-14 06:02:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-14 06:02:24,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2022-07-14 06:02:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 159 states have (on average 1.0754716981132075) internal successors, (171), 160 states have internal predecessors, (171), 0 states have call successors, (0), 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-14 06:02:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2022-07-14 06:02:24,270 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 118 [2022-07-14 06:02:24,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:02:24,271 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2022-07-14 06:02:24,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 149 states have (on average 2.248322147651007) internal successors, (335), 149 states have internal predecessors, (335), 0 states have call successors, (0), 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-14 06:02:24,271 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2022-07-14 06:02:24,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-14 06:02:24,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:02:24,272 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:02:24,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-07-14 06:02:24,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:02:24,497 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:02:24,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:02:24,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1419851237, now seen corresponding path program 22 times [2022-07-14 06:02:24,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:02:24,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823210104] [2022-07-14 06:02:24,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:02:24,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:02:24,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:02:25,116 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 276 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:02:25,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:02:25,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823210104] [2022-07-14 06:02:25,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823210104] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:02:25,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114662866] [2022-07-14 06:02:25,117 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 06:02:25,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:02:25,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:02:25,118 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:02:25,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-07-14 06:02:25,320 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 06:02:25,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:02:25,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 232 conjunts are in the unsatisfiable core [2022-07-14 06:02:25,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:02:25,335 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-14 06:02:25,338 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-14 06:02:26,159 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 16 treesize of output 12 [2022-07-14 06:02:26,368 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 18 treesize of output 20 [2022-07-14 06:02:26,513 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 18 treesize of output 20 [2022-07-14 06:02:26,645 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 18 treesize of output 20 [2022-07-14 06:02:26,784 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 18 treesize of output 20 [2022-07-14 06:02:26,929 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 18 treesize of output 20 [2022-07-14 06:02:27,079 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 18 treesize of output 20 [2022-07-14 06:02:27,239 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 18 treesize of output 20 [2022-07-14 06:02:27,390 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 18 treesize of output 20 [2022-07-14 06:02:27,537 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 18 treesize of output 20 [2022-07-14 06:02:27,697 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 18 treesize of output 20 [2022-07-14 06:02:27,854 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 18 treesize of output 20 [2022-07-14 06:02:28,024 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 18 treesize of output 20 [2022-07-14 06:02:28,186 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 18 treesize of output 20 [2022-07-14 06:02:28,353 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:02:28,353 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 21 treesize of output 21 [2022-07-14 06:02:28,577 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 338 proven. 432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:02:28,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:02:31,708 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2635 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549| Int)) (or (<= (+ 15 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2635) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 13 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|)) 0))) is different from false [2022-07-14 06:02:31,719 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2635 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549| Int)) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|)) (<= (+ 15 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 13 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|)) 0))) is different from false [2022-07-14 06:02:31,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:02:31,726 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 23 treesize of output 24 [2022-07-14 06:02:31,732 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:02:31,732 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 37 treesize of output 37 [2022-07-14 06:02:31,735 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 11 treesize of output 7 [2022-07-14 06:02:34,765 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 378 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-07-14 06:02:34,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114662866] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:02:34,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:02:34,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 49, 49] total 129 [2022-07-14 06:02:34,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173459009] [2022-07-14 06:02:34,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:02:34,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2022-07-14 06:02:34,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:02:34,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2022-07-14 06:02:34,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1503, Invalid=14748, Unknown=13, NotChecked=506, Total=16770 [2022-07-14 06:02:34,768 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand has 130 states, 129 states have (on average 2.7751937984496124) internal successors, (358), 130 states have internal predecessors, (358), 0 states have call successors, (0), 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-14 06:02:40,784 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse0 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (and (or (not (= (+ (- 1) .cse0) (+ (- 1) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|))) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) (or (forall ((v_ArrVal_2635 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2635) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) (and (<= 0 .cse1) (<= (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse0))) (<= |c_ULTIMATE.start_cstrcpy_~src~0#1.offset| 14) (<= .cse1 .cse0) (<= 14 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (<= 14 .cse0))) is different from false [2022-07-14 06:02:41,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:02:41,206 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2022-07-14 06:02:41,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-07-14 06:02:41,207 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 129 states have (on average 2.7751937984496124) internal successors, (358), 130 states have internal predecessors, (358), 0 states have call successors, (0), 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 122 [2022-07-14 06:02:41,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:02:41,207 INFO L225 Difference]: With dead ends: 161 [2022-07-14 06:02:41,207 INFO L226 Difference]: Without dead ends: 161 [2022-07-14 06:02:41,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 154 SyntacticMatches, 5 SemanticMatches, 178 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5647 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=4508, Invalid=26578, Unknown=78, NotChecked=1056, Total=32220 [2022-07-14 06:02:41,209 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 373 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 2195 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 3768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 2195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1221 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:02:41,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1074 Invalid, 3768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 2195 Invalid, 0 Unknown, 1221 Unchecked, 1.1s Time] [2022-07-14 06:02:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-14 06:02:41,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-07-14 06:02:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 159 states have (on average 1.0628930817610063) internal successors, (169), 160 states have internal predecessors, (169), 0 states have call successors, (0), 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-14 06:02:41,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 169 transitions. [2022-07-14 06:02:41,211 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 169 transitions. Word has length 122 [2022-07-14 06:02:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:02:41,212 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 169 transitions. [2022-07-14 06:02:41,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 129 states have (on average 2.7751937984496124) internal successors, (358), 130 states have internal predecessors, (358), 0 states have call successors, (0), 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-14 06:02:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 169 transitions. [2022-07-14 06:02:41,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-14 06:02:41,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:02:41,212 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:02:41,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-07-14 06:02:41,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-07-14 06:02:41,427 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:02:41,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:02:41,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1417438933, now seen corresponding path program 23 times [2022-07-14 06:02:41,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:02:41,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067187164] [2022-07-14 06:02:41,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:02:41,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:02:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:02:41,958 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 468 proven. 422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:02:41,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:02:41,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067187164] [2022-07-14 06:02:41,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067187164] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:02:41,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410385087] [2022-07-14 06:02:41,959 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 06:02:41,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:02:41,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:02:41,960 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:02:41,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-07-14 06:03:01,390 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2022-07-14 06:03:01,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:03:01,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 125 conjunts are in the unsatisfiable core [2022-07-14 06:03:01,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:03:01,457 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:03:01,457 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-14 06:03:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 497 proven. 393 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:03:02,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:03:03,952 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 497 proven. 393 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:03:03,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410385087] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:03:03,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:03:03,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 86 [2022-07-14 06:03:03,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346692900] [2022-07-14 06:03:03,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:03:03,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-14 06:03:03,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:03:03,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-14 06:03:03,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1168, Invalid=6142, Unknown=0, NotChecked=0, Total=7310 [2022-07-14 06:03:03,954 INFO L87 Difference]: Start difference. First operand 161 states and 169 transitions. Second operand has 86 states, 86 states have (on average 3.6511627906976742) internal successors, (314), 86 states have internal predecessors, (314), 0 states have call successors, (0), 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-14 06:03:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:03:05,494 INFO L93 Difference]: Finished difference Result 232 states and 240 transitions. [2022-07-14 06:03:05,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-14 06:03:05,494 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 3.6511627906976742) internal successors, (314), 86 states have internal predecessors, (314), 0 states have call successors, (0), 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 130 [2022-07-14 06:03:05,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:03:05,495 INFO L225 Difference]: With dead ends: 232 [2022-07-14 06:03:05,495 INFO L226 Difference]: Without dead ends: 168 [2022-07-14 06:03:05,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2504, Invalid=11538, Unknown=0, NotChecked=0, Total=14042 [2022-07-14 06:03:05,496 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 151 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:03:05,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 279 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:03:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-14 06:03:05,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2022-07-14 06:03:05,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 163 states have (on average 1.0613496932515338) internal successors, (173), 164 states have internal predecessors, (173), 0 states have call successors, (0), 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-14 06:03:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 173 transitions. [2022-07-14 06:03:05,499 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 173 transitions. Word has length 130 [2022-07-14 06:03:05,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:03:05,500 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 173 transitions. [2022-07-14 06:03:05,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 3.6511627906976742) internal successors, (314), 86 states have internal predecessors, (314), 0 states have call successors, (0), 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-14 06:03:05,500 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 173 transitions. [2022-07-14 06:03:05,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-14 06:03:05,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:03:05,501 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:03:05,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-07-14 06:03:05,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-07-14 06:03:05,715 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-14 06:03:05,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:03:05,716 INFO L85 PathProgramCache]: Analyzing trace with hash 367084040, now seen corresponding path program 24 times [2022-07-14 06:03:05,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:03:05,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384877799] [2022-07-14 06:03:05,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:03:05,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:03:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:03:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 32 proven. 915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:03:08,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:03:08,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384877799] [2022-07-14 06:03:08,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384877799] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:03:08,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027444931] [2022-07-14 06:03:08,107 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 06:03:08,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:03:08,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:03:08,109 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:03:08,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process