./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 57855fd15a600148bf8b2d693e60ae0827a95c157ed69e07e1c42c75fda7c9c4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:27:40,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:27:40,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:27:40,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:27:40,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:27:40,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:27:40,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:27:40,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:27:40,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:27:40,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:27:40,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:27:40,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:27:40,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:27:40,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:27:40,470 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:27:40,471 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:27:40,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:27:40,476 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:27:40,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:27:40,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:27:40,482 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:27:40,485 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:27:40,486 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:27:40,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:27:40,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:27:40,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:27:40,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:27:40,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:27:40,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:27:40,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:27:40,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:27:40,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:27:40,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:27:40,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:27:40,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:27:40,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:27:40,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:27:40,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:27:40,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:27:40,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:27:40,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:27:40,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:27:40,503 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:27:40,532 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:27:40,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:27:40,533 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:27:40,533 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:27:40,534 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:27:40,534 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:27:40,534 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:27:40,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:27:40,535 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:27:40,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:27:40,536 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:27:40,536 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:27:40,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:27:40,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:27:40,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:27:40,537 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:27:40,537 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:27:40,537 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:27:40,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:27:40,538 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:27:40,538 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:27:40,538 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:27:40,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:27:40,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:27:40,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:27:40,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:27:40,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:27:40,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:27:40,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:27:40,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:27:40,540 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 -> 57855fd15a600148bf8b2d693e60ae0827a95c157ed69e07e1c42c75fda7c9c4 [2022-07-20 05:27:40,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:27:40,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:27:40,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:27:40,821 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:27:40,822 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:27:40,824 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca-2.i [2022-07-20 05:27:40,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/569ab4a6f/add490da9a1e49d799d8429e43f43661/FLAGa3c8121ac [2022-07-20 05:27:41,345 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:27:41,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca-2.i [2022-07-20 05:27:41,357 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/569ab4a6f/add490da9a1e49d799d8429e43f43661/FLAGa3c8121ac [2022-07-20 05:27:41,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/569ab4a6f/add490da9a1e49d799d8429e43f43661 [2022-07-20 05:27:41,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:27:41,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:27:41,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:27:41,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:27:41,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:27:41,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:27:41" (1/1) ... [2022-07-20 05:27:41,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18ec8c1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:27:41, skipping insertion in model container [2022-07-20 05:27:41,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:27:41" (1/1) ... [2022-07-20 05:27:41,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:27:41,912 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:27:42,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:27:42,189 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:27:42,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:27:42,254 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:27:42,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:27:42 WrapperNode [2022-07-20 05:27:42,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:27:42,256 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:27:42,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:27:42,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:27:42,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:27:42" (1/1) ... [2022-07-20 05:27:42,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:27:42" (1/1) ... [2022-07-20 05:27:42,309 INFO L137 Inliner]: procedures = 117, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2022-07-20 05:27:42,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:27:42,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:27:42,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:27:42,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:27:42,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:27:42" (1/1) ... [2022-07-20 05:27:42,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:27:42" (1/1) ... [2022-07-20 05:27:42,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:27:42" (1/1) ... [2022-07-20 05:27:42,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:27:42" (1/1) ... [2022-07-20 05:27:42,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:27:42" (1/1) ... [2022-07-20 05:27:42,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:27:42" (1/1) ... [2022-07-20 05:27:42,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:27:42" (1/1) ... [2022-07-20 05:27:42,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:27:42,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:27:42,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:27:42,357 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:27:42,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:27:42" (1/1) ... [2022-07-20 05:27:42,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:27:42,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:27:42,382 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 05:27:42,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 05:27:42,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 05:27:42,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 05:27:42,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 05:27:42,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:27:42,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:27:42,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:27:42,548 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:27:42,560 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:27:42,818 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:27:42,823 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:27:42,825 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 05:27:42,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:27:42 BoogieIcfgContainer [2022-07-20 05:27:42,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:27:42,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:27:42,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:27:42,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:27:42,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:27:41" (1/3) ... [2022-07-20 05:27:42,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfdb171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:27:42, skipping insertion in model container [2022-07-20 05:27:42,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:27:42" (2/3) ... [2022-07-20 05:27:42,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfdb171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:27:42, skipping insertion in model container [2022-07-20 05:27:42,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:27:42" (3/3) ... [2022-07-20 05:27:42,838 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca-2.i [2022-07-20 05:27:42,853 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:27:42,853 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-07-20 05:27:42,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:27:42,914 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@2acd21a4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6c85b75d [2022-07-20 05:27:42,914 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-07-20 05:27:42,918 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:27:42,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:42,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:42,928 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:42,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:42,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029043, now seen corresponding path program 1 times [2022-07-20 05:27:42,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:42,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410141046] [2022-07-20 05:27:42,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:42,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:43,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:43,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410141046] [2022-07-20 05:27:43,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410141046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:27:43,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:27:43,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:27:43,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74302060] [2022-07-20 05:27:43,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:27:43,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:27:43,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:43,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:27:43,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:27:43,199 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 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-20 05:27:43,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:43,254 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-07-20 05:27:43,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:27:43,257 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-20 05:27:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:43,263 INFO L225 Difference]: With dead ends: 36 [2022-07-20 05:27:43,263 INFO L226 Difference]: Without dead ends: 34 [2022-07-20 05:27:43,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:27:43,270 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:43,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 35 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:27:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-20 05:27:43,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-20 05:27:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.6) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:43,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-07-20 05:27:43,332 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 7 [2022-07-20 05:27:43,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:43,332 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-07-20 05:27:43,333 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-20 05:27:43,333 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-07-20 05:27:43,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:27:43,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:43,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:43,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 05:27:43,335 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:43,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:43,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029044, now seen corresponding path program 1 times [2022-07-20 05:27:43,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:43,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261510609] [2022-07-20 05:27:43,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:43,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:43,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:43,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261510609] [2022-07-20 05:27:43,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261510609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:27:43,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:27:43,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:27:43,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341343287] [2022-07-20 05:27:43,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:27:43,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:27:43,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:43,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:27:43,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:27:43,446 INFO L87 Difference]: Start difference. First operand 34 states and 40 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-20 05:27:43,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:43,484 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-07-20 05:27:43,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:27:43,485 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-20 05:27:43,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:43,487 INFO L225 Difference]: With dead ends: 33 [2022-07-20 05:27:43,487 INFO L226 Difference]: Without dead ends: 33 [2022-07-20 05:27:43,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:27:43,492 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 65 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:43,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 29 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:27:43,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-20 05:27:43,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-20 05:27:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.56) internal successors, (39), 32 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-20 05:27:43,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-20 05:27:43,502 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2022-07-20 05:27:43,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:43,502 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-20 05:27:43,503 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-20 05:27:43,503 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-20 05:27:43,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:27:43,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:43,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:43,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 05:27:43,505 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:43,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:43,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029097, now seen corresponding path program 1 times [2022-07-20 05:27:43,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:43,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162864765] [2022-07-20 05:27:43,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:43,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:43,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:43,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:43,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162864765] [2022-07-20 05:27:43,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162864765] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:27:43,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:27:43,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:27:43,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323203883] [2022-07-20 05:27:43,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:27:43,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:27:43,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:43,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:27:43,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:27:43,578 INFO L87 Difference]: Start difference. First operand 33 states and 39 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-20 05:27:43,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:43,602 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-07-20 05:27:43,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:27:43,603 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-20 05:27:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:43,605 INFO L225 Difference]: With dead ends: 59 [2022-07-20 05:27:43,606 INFO L226 Difference]: Without dead ends: 59 [2022-07-20 05:27:43,606 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-20 05:27:43,607 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 56 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 70 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-20 05:27:43,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 70 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:27:43,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-20 05:27:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 36. [2022-07-20 05:27:43,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-07-20 05:27:43,615 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 7 [2022-07-20 05:27:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:43,616 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-07-20 05:27:43,616 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-20 05:27:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-07-20 05:27:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:27:43,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:43,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:43,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 05:27:43,617 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:43,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:43,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2022-07-20 05:27:43,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:43,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955481837] [2022-07-20 05:27:43,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:43,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:43,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:43,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955481837] [2022-07-20 05:27:43,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955481837] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:27:43,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:27:43,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:27:43,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516403059] [2022-07-20 05:27:43,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:27:43,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:27:43,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:43,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:27:43,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:27:43,687 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-20 05:27:43,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:43,740 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-07-20 05:27:43,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:27:43,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-20 05:27:43,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:43,744 INFO L225 Difference]: With dead ends: 63 [2022-07-20 05:27:43,744 INFO L226 Difference]: Without dead ends: 63 [2022-07-20 05:27:43,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:27:43,746 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 64 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:43,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 73 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:27:43,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-20 05:27:43,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 38. [2022-07-20 05:27:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:43,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-07-20 05:27:43,751 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 7 [2022-07-20 05:27:43,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:43,751 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-07-20 05:27:43,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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-20 05:27:43,752 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-07-20 05:27:43,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:27:43,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:43,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:43,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 05:27:43,753 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:43,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:43,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1954751785, now seen corresponding path program 1 times [2022-07-20 05:27:43,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:43,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318643671] [2022-07-20 05:27:43,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:43,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:43,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:43,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:43,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318643671] [2022-07-20 05:27:43,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318643671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:27:43,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:27:43,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:27:43,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730600601] [2022-07-20 05:27:43,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:27:43,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:27:43,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:43,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:27:43,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:27:43,803 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:43,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:43,877 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-07-20 05:27:43,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:27:43,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 05:27:43,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:43,879 INFO L225 Difference]: With dead ends: 39 [2022-07-20 05:27:43,880 INFO L226 Difference]: Without dead ends: 39 [2022-07-20 05:27:43,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:27:43,882 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 70 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:43,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 67 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:27:43,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-20 05:27:43,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-07-20 05:27:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.5) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2022-07-20 05:27:43,886 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 11 [2022-07-20 05:27:43,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:43,887 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2022-07-20 05:27:43,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:43,887 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-07-20 05:27:43,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:27:43,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:43,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:43,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 05:27:43,888 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:43,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:43,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1954751784, now seen corresponding path program 1 times [2022-07-20 05:27:43,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:43,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262625782] [2022-07-20 05:27:43,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:43,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:43,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:43,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262625782] [2022-07-20 05:27:43,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262625782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:27:43,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:27:43,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:27:43,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737298269] [2022-07-20 05:27:43,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:27:43,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:27:43,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:43,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:27:43,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:27:43,995 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:44,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:44,128 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-07-20 05:27:44,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:27:44,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 05:27:44,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:44,130 INFO L225 Difference]: With dead ends: 43 [2022-07-20 05:27:44,130 INFO L226 Difference]: Without dead ends: 43 [2022-07-20 05:27:44,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:27:44,131 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 144 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:44,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 83 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:27:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-20 05:27:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-07-20 05:27:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.46875) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-07-20 05:27:44,135 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 11 [2022-07-20 05:27:44,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:44,135 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-07-20 05:27:44,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:44,135 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-07-20 05:27:44,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:27:44,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:44,136 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:44,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 05:27:44,136 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:44,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:44,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2022-07-20 05:27:44,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:44,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504494978] [2022-07-20 05:27:44,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:44,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:44,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:44,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504494978] [2022-07-20 05:27:44,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504494978] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:27:44,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676831397] [2022-07-20 05:27:44,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:44,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:44,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:27:44,224 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:27:44,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 05:27:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:44,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 05:27:44,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:27:44,385 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:27:44,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:27:44,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:44,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:27:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:44,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676831397] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:27:44,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:27:44,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-07-20 05:27:44,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089998745] [2022-07-20 05:27:44,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:27:44,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:27:44,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:44,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:27:44,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:27:44,599 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:44,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:44,739 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2022-07-20 05:27:44,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:27:44,739 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 05:27:44,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:44,740 INFO L225 Difference]: With dead ends: 89 [2022-07-20 05:27:44,740 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 05:27:44,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:27:44,741 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 165 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:44,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 201 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:27:44,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 05:27:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 36. [2022-07-20 05:27:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-07-20 05:27:44,746 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 11 [2022-07-20 05:27:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:44,746 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-07-20 05:27:44,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:44,746 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-07-20 05:27:44,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:27:44,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:44,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:44,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 05:27:44,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:44,968 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:44,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:44,969 INFO L85 PathProgramCache]: Analyzing trace with hash -466410634, now seen corresponding path program 1 times [2022-07-20 05:27:44,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:44,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133742825] [2022-07-20 05:27:44,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:44,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:45,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:45,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133742825] [2022-07-20 05:27:45,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133742825] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:27:45,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:27:45,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:27:45,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854316527] [2022-07-20 05:27:45,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:27:45,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:27:45,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:45,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:27:45,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:27:45,039 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:45,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:45,062 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-07-20 05:27:45,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:27:45,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 05:27:45,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:45,064 INFO L225 Difference]: With dead ends: 73 [2022-07-20 05:27:45,064 INFO L226 Difference]: Without dead ends: 73 [2022-07-20 05:27:45,064 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-20 05:27:45,065 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 42 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:45,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 108 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:27:45,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-20 05:27:45,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2022-07-20 05:27:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.35) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-07-20 05:27:45,069 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 12 [2022-07-20 05:27:45,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:45,069 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-07-20 05:27:45,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-07-20 05:27:45,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:27:45,070 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:45,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:45,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 05:27:45,071 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:45,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:45,071 INFO L85 PathProgramCache]: Analyzing trace with hash -467763174, now seen corresponding path program 1 times [2022-07-20 05:27:45,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:45,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072568708] [2022-07-20 05:27:45,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:45,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:45,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:45,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072568708] [2022-07-20 05:27:45,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072568708] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:27:45,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:27:45,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:27:45,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455582536] [2022-07-20 05:27:45,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:27:45,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:27:45,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:45,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:27:45,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:27:45,137 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:45,214 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-07-20 05:27:45,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:27:45,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 05:27:45,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:45,216 INFO L225 Difference]: With dead ends: 47 [2022-07-20 05:27:45,216 INFO L226 Difference]: Without dead ends: 47 [2022-07-20 05:27:45,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:27:45,219 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 62 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:45,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 64 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:27:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-20 05:27:45,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-07-20 05:27:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-07-20 05:27:45,229 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 12 [2022-07-20 05:27:45,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:45,229 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-07-20 05:27:45,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:45,230 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-07-20 05:27:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:27:45,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:45,230 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:45,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 05:27:45,231 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:45,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:45,231 INFO L85 PathProgramCache]: Analyzing trace with hash -467763173, now seen corresponding path program 1 times [2022-07-20 05:27:45,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:45,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415843890] [2022-07-20 05:27:45,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:45,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:45,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:45,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:45,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415843890] [2022-07-20 05:27:45,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415843890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:27:45,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:27:45,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:27:45,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126049558] [2022-07-20 05:27:45,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:27:45,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:27:45,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:45,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:27:45,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:27:45,314 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:45,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:45,394 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-07-20 05:27:45,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:27:45,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 05:27:45,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:45,395 INFO L225 Difference]: With dead ends: 47 [2022-07-20 05:27:45,395 INFO L226 Difference]: Without dead ends: 47 [2022-07-20 05:27:45,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:27:45,398 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 92 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:45,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:27:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-20 05:27:45,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-07-20 05:27:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-07-20 05:27:45,402 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 12 [2022-07-20 05:27:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:45,402 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-07-20 05:27:45,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:45,403 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-07-20 05:27:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:27:45,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:45,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:45,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 05:27:45,404 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:45,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:45,404 INFO L85 PathProgramCache]: Analyzing trace with hash 213647736, now seen corresponding path program 1 times [2022-07-20 05:27:45,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:45,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526058082] [2022-07-20 05:27:45,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:45,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:45,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:45,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526058082] [2022-07-20 05:27:45,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526058082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:27:45,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:27:45,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:27:45,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226698045] [2022-07-20 05:27:45,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:27:45,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:27:45,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:45,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:27:45,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:27:45,448 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:45,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:45,467 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-07-20 05:27:45,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:27:45,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-20 05:27:45,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:45,468 INFO L225 Difference]: With dead ends: 49 [2022-07-20 05:27:45,468 INFO L226 Difference]: Without dead ends: 49 [2022-07-20 05:27:45,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:27:45,469 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 73 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:45,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 59 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:27:45,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-20 05:27:45,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2022-07-20 05:27:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-07-20 05:27:45,472 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 12 [2022-07-20 05:27:45,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:45,472 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-07-20 05:27:45,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:45,473 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-07-20 05:27:45,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:27:45,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:45,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:45,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 05:27:45,474 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:45,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:45,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1302901600, now seen corresponding path program 1 times [2022-07-20 05:27:45,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:45,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564515070] [2022-07-20 05:27:45,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:45,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:45,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:45,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564515070] [2022-07-20 05:27:45,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564515070] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:27:45,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:27:45,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:27:45,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875938064] [2022-07-20 05:27:45,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:27:45,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:27:45,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:45,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:27:45,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:27:45,516 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:45,562 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-07-20 05:27:45,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:27:45,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 05:27:45,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:45,563 INFO L225 Difference]: With dead ends: 35 [2022-07-20 05:27:45,564 INFO L226 Difference]: Without dead ends: 35 [2022-07-20 05:27:45,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:27:45,564 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:45,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 76 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:27:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-20 05:27:45,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-20 05:27:45,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 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-20 05:27:45,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-07-20 05:27:45,569 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 16 [2022-07-20 05:27:45,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:45,569 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-07-20 05:27:45,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:45,569 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-07-20 05:27:45,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:27:45,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:45,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:45,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 05:27:45,573 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:45,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:45,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1302901599, now seen corresponding path program 1 times [2022-07-20 05:27:45,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:45,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831154919] [2022-07-20 05:27:45,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:45,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:45,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:45,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831154919] [2022-07-20 05:27:45,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831154919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:27:45,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:27:45,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:27:45,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111167553] [2022-07-20 05:27:45,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:27:45,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:27:45,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:45,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:27:45,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:27:45,671 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:45,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:45,715 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-07-20 05:27:45,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:27:45,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 05:27:45,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:45,717 INFO L225 Difference]: With dead ends: 69 [2022-07-20 05:27:45,717 INFO L226 Difference]: Without dead ends: 69 [2022-07-20 05:27:45,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:27:45,718 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:45,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 128 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:27:45,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-20 05:27:45,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2022-07-20 05:27:45,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:45,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-07-20 05:27:45,730 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 16 [2022-07-20 05:27:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:45,730 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-07-20 05:27:45,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-07-20 05:27:45,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:27:45,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:45,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:45,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 05:27:45,732 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:45,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:45,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1889707613, now seen corresponding path program 1 times [2022-07-20 05:27:45,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:45,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533889462] [2022-07-20 05:27:45,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:45,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:45,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:45,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533889462] [2022-07-20 05:27:45,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533889462] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:27:45,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:27:45,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:27:45,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263026057] [2022-07-20 05:27:45,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:27:45,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:27:45,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:45,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:27:45,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:27:45,899 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:46,081 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-07-20 05:27:46,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:27:46,082 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-20 05:27:46,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:46,084 INFO L225 Difference]: With dead ends: 57 [2022-07-20 05:27:46,084 INFO L226 Difference]: Without dead ends: 57 [2022-07-20 05:27:46,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-07-20 05:27:46,085 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 74 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:46,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 110 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:27:46,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-20 05:27:46,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-07-20 05:27:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 54 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2022-07-20 05:27:46,088 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 16 [2022-07-20 05:27:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:46,089 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2022-07-20 05:27:46,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:46,089 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-07-20 05:27:46,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:27:46,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:46,090 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:46,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 05:27:46,090 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:46,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:46,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1717205610, now seen corresponding path program 1 times [2022-07-20 05:27:46,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:46,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516393496] [2022-07-20 05:27:46,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:46,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:46,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:46,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:46,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516393496] [2022-07-20 05:27:46,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516393496] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:27:46,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:27:46,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:27:46,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498638813] [2022-07-20 05:27:46,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:27:46,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:27:46,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:46,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:27:46,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:27:46,168 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:46,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:46,202 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-07-20 05:27:46,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:27:46,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 05:27:46,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:46,203 INFO L225 Difference]: With dead ends: 61 [2022-07-20 05:27:46,204 INFO L226 Difference]: Without dead ends: 61 [2022-07-20 05:27:46,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:27:46,206 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:46,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 112 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:27:46,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-20 05:27:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2022-07-20 05:27:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 56 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-07-20 05:27:46,213 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 17 [2022-07-20 05:27:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:46,213 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-07-20 05:27:46,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-07-20 05:27:46,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:27:46,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:46,215 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:46,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 05:27:46,216 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:46,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:46,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1566644436, now seen corresponding path program 1 times [2022-07-20 05:27:46,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:46,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129812880] [2022-07-20 05:27:46,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:46,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:46,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:46,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129812880] [2022-07-20 05:27:46,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129812880] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:27:46,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:27:46,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:27:46,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808855051] [2022-07-20 05:27:46,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:27:46,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:27:46,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:46,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:27:46,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:27:46,338 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:46,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:46,494 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2022-07-20 05:27:46,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:27:46,495 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 05:27:46,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:46,495 INFO L225 Difference]: With dead ends: 85 [2022-07-20 05:27:46,495 INFO L226 Difference]: Without dead ends: 85 [2022-07-20 05:27:46,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:27:46,496 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:46,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 170 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:27:46,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-20 05:27:46,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2022-07-20 05:27:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.208955223880597) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:46,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-07-20 05:27:46,499 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 17 [2022-07-20 05:27:46,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:46,500 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-07-20 05:27:46,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:46,500 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-07-20 05:27:46,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:27:46,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:46,501 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:46,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 05:27:46,501 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:46,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash 286780758, now seen corresponding path program 1 times [2022-07-20 05:27:46,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:46,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400353757] [2022-07-20 05:27:46,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:46,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:46,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:46,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400353757] [2022-07-20 05:27:46,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400353757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:27:46,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:27:46,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 05:27:46,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668927319] [2022-07-20 05:27:46,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:27:46,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:27:46,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:46,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:27:46,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:27:46,599 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:46,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:46,751 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2022-07-20 05:27:46,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:27:46,751 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 05:27:46,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:46,752 INFO L225 Difference]: With dead ends: 107 [2022-07-20 05:27:46,752 INFO L226 Difference]: Without dead ends: 107 [2022-07-20 05:27:46,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-07-20 05:27:46,753 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 79 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:46,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 176 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:27:46,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-20 05:27:46,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2022-07-20 05:27:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 72 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2022-07-20 05:27:46,756 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 17 [2022-07-20 05:27:46,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:46,756 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2022-07-20 05:27:46,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-07-20 05:27:46,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 05:27:46,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:46,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:46,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 05:27:46,758 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:46,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:46,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2041976217, now seen corresponding path program 1 times [2022-07-20 05:27:46,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:46,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075611441] [2022-07-20 05:27:46,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:46,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:46,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:46,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:46,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075611441] [2022-07-20 05:27:46,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075611441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:27:46,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:27:46,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:27:46,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274856263] [2022-07-20 05:27:46,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:27:46,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:27:46,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:46,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:27:46,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:27:46,817 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:46,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:46,830 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-07-20 05:27:46,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:27:46,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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-20 05:27:46,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:46,831 INFO L225 Difference]: With dead ends: 72 [2022-07-20 05:27:46,831 INFO L226 Difference]: Without dead ends: 43 [2022-07-20 05:27:46,831 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-20 05:27:46,832 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:46,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 50 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:27:46,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-20 05:27:46,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-20 05:27:46,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.2) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-07-20 05:27:46,834 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 18 [2022-07-20 05:27:46,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:46,834 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-07-20 05:27:46,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:46,835 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-07-20 05:27:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:27:46,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:46,836 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:46,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 05:27:46,836 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:46,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:46,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2012971173, now seen corresponding path program 1 times [2022-07-20 05:27:46,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:46,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717998123] [2022-07-20 05:27:46,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:46,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:47,119 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-20 05:27:47,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:47,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717998123] [2022-07-20 05:27:47,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717998123] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:27:47,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874048457] [2022-07-20 05:27:47,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:47,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:47,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:27:47,121 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:27:47,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 05:27:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:47,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-20 05:27:47,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:27:47,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:27:47,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:27:47,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:27:47,524 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-20 05:27:47,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:27:47,998 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-20 05:27:47,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874048457] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:27:47,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:27:47,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-07-20 05:27:47,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166895937] [2022-07-20 05:27:47,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:27:48,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-20 05:27:48,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:48,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-20 05:27:48,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2022-07-20 05:27:48,002 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:49,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:49,546 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-07-20 05:27:49,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-20 05:27:49,547 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 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 20 [2022-07-20 05:27:49,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:49,547 INFO L225 Difference]: With dead ends: 84 [2022-07-20 05:27:49,547 INFO L226 Difference]: Without dead ends: 61 [2022-07-20 05:27:49,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=432, Invalid=2648, Unknown=0, NotChecked=0, Total=3080 [2022-07-20 05:27:49,549 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 113 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:49,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 252 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:27:49,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-20 05:27:49,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2022-07-20 05:27:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-07-20 05:27:49,551 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 20 [2022-07-20 05:27:49,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:49,551 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-07-20 05:27:49,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:49,551 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-07-20 05:27:49,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 05:27:49,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:49,551 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:49,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 05:27:49,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:49,764 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:49,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:49,764 INFO L85 PathProgramCache]: Analyzing trace with hash -718716967, now seen corresponding path program 1 times [2022-07-20 05:27:49,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:49,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114483667] [2022-07-20 05:27:49,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:49,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:49,897 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-20 05:27:49,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:49,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114483667] [2022-07-20 05:27:49,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114483667] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:27:49,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527789045] [2022-07-20 05:27:49,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:49,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:49,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:27:49,900 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:27:49,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 05:27:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:49,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 05:27:49,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:27:50,095 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-20 05:27:50,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:27:50,237 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-20 05:27:50,258 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-20 05:27:50,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527789045] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:27:50,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:27:50,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-07-20 05:27:50,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713853662] [2022-07-20 05:27:50,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:27:50,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 05:27:50,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:50,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 05:27:50,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2022-07-20 05:27:50,260 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:50,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:50,505 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-07-20 05:27:50,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 05:27:50,505 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-20 05:27:50,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:50,506 INFO L225 Difference]: With dead ends: 56 [2022-07-20 05:27:50,506 INFO L226 Difference]: Without dead ends: 56 [2022-07-20 05:27:50,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2022-07-20 05:27:50,507 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 255 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:50,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 95 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:27:50,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-20 05:27:50,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-07-20 05:27:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 51 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-20 05:27:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-07-20 05:27:50,509 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 21 [2022-07-20 05:27:50,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:50,509 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-07-20 05:27:50,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-07-20 05:27:50,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 05:27:50,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:50,510 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:50,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 05:27:50,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:50,720 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:50,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash -805389510, now seen corresponding path program 1 times [2022-07-20 05:27:50,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:50,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134998858] [2022-07-20 05:27:50,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:50,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:27:50,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:50,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134998858] [2022-07-20 05:27:50,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134998858] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:27:50,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156156599] [2022-07-20 05:27:50,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:50,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:50,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:27:50,884 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:27:50,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 05:27:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:50,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-20 05:27:50,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:27:50,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:27:50,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:27:50,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-20 05:27:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:27:51,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:27:51,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:27:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:27:51,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156156599] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:27:51,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:27:51,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2022-07-20 05:27:51,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038349972] [2022-07-20 05:27:51,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:27:51,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-20 05:27:51,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:51,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-20 05:27:51,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2022-07-20 05:27:51,561 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:51,860 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-07-20 05:27:51,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:27:51,861 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-20 05:27:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:51,861 INFO L225 Difference]: With dead ends: 52 [2022-07-20 05:27:51,861 INFO L226 Difference]: Without dead ends: 52 [2022-07-20 05:27:51,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=1055, Unknown=0, NotChecked=0, Total=1260 [2022-07-20 05:27:51,862 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:51,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 113 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:27:51,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-20 05:27:51,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-07-20 05:27:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-07-20 05:27:51,864 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 22 [2022-07-20 05:27:51,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:51,864 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-07-20 05:27:51,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-07-20 05:27:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 05:27:51,865 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:51,865 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:51,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 05:27:52,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:52,075 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:52,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash -279519168, now seen corresponding path program 1 times [2022-07-20 05:27:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:52,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136738979] [2022-07-20 05:27:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:52,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:27:52,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:52,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136738979] [2022-07-20 05:27:52,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136738979] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:27:52,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998530783] [2022-07-20 05:27:52,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:52,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:52,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:27:52,321 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:27:52,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 05:27:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:52,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-20 05:27:52,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:27:52,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:27:52,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:27:52,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:27:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:27:52,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:27:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:27:53,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998530783] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:27:53,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:27:53,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-07-20 05:27:53,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902972851] [2022-07-20 05:27:53,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:27:53,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-20 05:27:53,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:53,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-20 05:27:53,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2022-07-20 05:27:53,127 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:54,004 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-07-20 05:27:54,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 05:27:54,006 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 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) Word has length 26 [2022-07-20 05:27:54,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:54,007 INFO L225 Difference]: With dead ends: 51 [2022-07-20 05:27:54,007 INFO L226 Difference]: Without dead ends: 37 [2022-07-20 05:27:54,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=297, Invalid=1773, Unknown=0, NotChecked=0, Total=2070 [2022-07-20 05:27:54,009 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 62 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:54,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 227 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:27:54,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-20 05:27:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-07-20 05:27:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 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-20 05:27:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-07-20 05:27:54,011 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 26 [2022-07-20 05:27:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:54,011 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-07-20 05:27:54,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-07-20 05:27:54,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:27:54,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:54,011 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:54,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 05:27:54,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-20 05:27:54,212 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:54,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:54,213 INFO L85 PathProgramCache]: Analyzing trace with hash -57121321, now seen corresponding path program 2 times [2022-07-20 05:27:54,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:54,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5714065] [2022-07-20 05:27:54,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:54,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:54,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:54,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5714065] [2022-07-20 05:27:54,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5714065] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:27:54,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454709815] [2022-07-20 05:27:54,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:27:54,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:54,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:27:54,516 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:27:54,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 05:27:54,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:27:54,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:27:54,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-20 05:27:54,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:27:54,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:27:54,644 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-20 05:27:54,849 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-20 05:27:55,002 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:27:55,003 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-20 05:27:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:55,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:27:55,520 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| Int)) (or (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| 1)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-20 05:27:55,534 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_280) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| 1)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|)) (< |c_ULTIMATE.start_cstrncpy_~src#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src#1.base|)))) is different from false [2022-07-20 05:27:55,547 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| 1)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)))) is different from false [2022-07-20 05:27:55,558 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:27:55,559 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-20 05:27:55,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:27:55,567 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-20 05:27:55,572 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-20 05:27:55,577 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-20 05:27:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 05:27:55,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454709815] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:27:55,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:27:55,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 38 [2022-07-20 05:27:55,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889190542] [2022-07-20 05:27:55,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:27:55,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-20 05:27:55,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:55,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-20 05:27:55,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1079, Unknown=4, NotChecked=204, Total=1406 [2022-07-20 05:27:55,693 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:56,479 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-07-20 05:27:56,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 05:27:56,480 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 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-20 05:27:56,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:56,480 INFO L225 Difference]: With dead ends: 58 [2022-07-20 05:27:56,480 INFO L226 Difference]: Without dead ends: 45 [2022-07-20 05:27:56,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=253, Invalid=2107, Unknown=4, NotChecked=288, Total=2652 [2022-07-20 05:27:56,482 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:56,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 263 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 217 Invalid, 0 Unknown, 218 Unchecked, 0.1s Time] [2022-07-20 05:27:56,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-20 05:27:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-07-20 05:27:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-07-20 05:27:56,483 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 27 [2022-07-20 05:27:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:56,484 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-07-20 05:27:56,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-07-20 05:27:56,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 05:27:56,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:56,484 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:56,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 05:27:56,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:56,685 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:56,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:56,685 INFO L85 PathProgramCache]: Analyzing trace with hash 614687385, now seen corresponding path program 2 times [2022-07-20 05:27:56,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:56,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927963153] [2022-07-20 05:27:56,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:56,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 05:27:56,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:56,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927963153] [2022-07-20 05:27:56,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927963153] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:27:56,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229250755] [2022-07-20 05:27:56,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:27:56,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:56,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:27:56,972 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:27:56,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 05:27:57,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:27:57,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:27:57,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-20 05:27:57,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:27:57,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:27:57,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:27:57,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:27:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 05:27:57,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:27:57,986 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 05:27:57,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229250755] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:27:57,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:27:57,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2022-07-20 05:27:57,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262455616] [2022-07-20 05:27:57,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:27:57,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-20 05:27:57,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:57,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-20 05:27:57,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2022-07-20 05:27:57,988 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:59,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:59,124 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-07-20 05:27:59,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 05:27:59,125 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-20 05:27:59,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:59,126 INFO L225 Difference]: With dead ends: 54 [2022-07-20 05:27:59,126 INFO L226 Difference]: Without dead ends: 54 [2022-07-20 05:27:59,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=349, Invalid=2407, Unknown=0, NotChecked=0, Total=2756 [2022-07-20 05:27:59,127 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 63 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:59,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 161 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:27:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-20 05:27:59,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-07-20 05:27:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-07-20 05:27:59,130 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 32 [2022-07-20 05:27:59,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:59,131 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-07-20 05:27:59,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:59,131 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-07-20 05:27:59,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 05:27:59,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:59,132 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:59,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-20 05:27:59,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:59,347 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:27:59,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:59,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1981775400, now seen corresponding path program 3 times [2022-07-20 05:27:59,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:59,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559408717] [2022-07-20 05:27:59,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:59,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:59,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:59,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559408717] [2022-07-20 05:27:59,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559408717] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:27:59,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583377008] [2022-07-20 05:27:59,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:27:59,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:59,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:27:59,677 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:27:59,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 05:27:59,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 05:27:59,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:27:59,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-20 05:27:59,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:27:59,959 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-20 05:28:00,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:28:00,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 05:28:00,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:28:00,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 05:28:00,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:28:00,380 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:28:00,380 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-20 05:28:00,383 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:00,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:28:09,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) is different from false [2022-07-20 05:28:11,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~dst#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~dst#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) is different from false [2022-07-20 05:28:12,098 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_main_~nondetArea~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ 1 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) is different from false [2022-07-20 05:28:12,104 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 372 treesize of output 360 [2022-07-20 05:28:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 05:28:12,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583377008] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:28:12,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:28:12,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 42 [2022-07-20 05:28:12,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987696024] [2022-07-20 05:28:12,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:28:12,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-20 05:28:12,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:28:12,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-20 05:28:12,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1358, Unknown=16, NotChecked=228, Total=1722 [2022-07-20 05:28:12,507 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:13,254 WARN L833 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) (< 2 |c_ULTIMATE.start_main_~length~0#1|) (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_main_~nondetArea~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ 1 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) (<= 3 |c_ULTIMATE.start_main_~length~0#1|) (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length~0#1| |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< 2 |ULTIMATE.start_main_~length~0#1|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (<= |c_ULTIMATE.start_main_~length~0#1| 3) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 2)) is different from false [2022-07-20 05:28:13,743 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_cstrncpy_~src#1.base| |c_ULTIMATE.start_cstrncpy_~dst#1.base|)) (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ (- 1) |ULTIMATE.start_main_~length~0#1|)) 0) (<= |ULTIMATE.start_main_~length~0#1| 3) (< 2 |ULTIMATE.start_main_~length~0#1|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~src#1.base|) 2) 0) (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~dst#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~dst#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) (= |c_ULTIMATE.start_cstrncpy_~dst#1.offset| 0) (= |c_ULTIMATE.start_cstrncpy_~src#1.offset| 0)) is different from false [2022-07-20 05:28:14,217 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| 0) (not (= |c_ULTIMATE.start_cstrncpy_~d~0#1.base| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)) (= |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) 2) 0) (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length~0#1|)) 0) (< 2 |ULTIMATE.start_main_~length~0#1|)))) is different from false [2022-07-20 05:28:14,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:28:14,425 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-07-20 05:28:14,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:28:14,426 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-20 05:28:14,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:28:14,426 INFO L225 Difference]: With dead ends: 78 [2022-07-20 05:28:14,427 INFO L226 Difference]: Without dead ends: 59 [2022-07-20 05:28:14,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=217, Invalid=2338, Unknown=19, NotChecked=618, Total=3192 [2022-07-20 05:28:14,428 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:28:14,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 346 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 249 Invalid, 0 Unknown, 193 Unchecked, 0.1s Time] [2022-07-20 05:28:14,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-20 05:28:14,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-07-20 05:28:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-07-20 05:28:14,430 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 37 [2022-07-20 05:28:14,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:28:14,430 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-07-20 05:28:14,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-07-20 05:28:14,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 05:28:14,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:28:14,431 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:28:14,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 05:28:14,651 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,SelfDestructingSolverStorable24 [2022-07-20 05:28:14,651 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:28:14,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:28:14,652 INFO L85 PathProgramCache]: Analyzing trace with hash 207254747, now seen corresponding path program 4 times [2022-07-20 05:28:14,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:28:14,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229009201] [2022-07-20 05:28:14,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:28:14,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:28:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:28:14,837 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:14,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:28:14,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229009201] [2022-07-20 05:28:14,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229009201] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:28:14,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923454148] [2022-07-20 05:28:14,837 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:28:14,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:14,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:28:14,839 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:28:14,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 05:28:14,956 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:28:14,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:28:14,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-20 05:28:14,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:28:14,980 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:28:14,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:28:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:15,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:28:15,660 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:15,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923454148] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:28:15,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:28:15,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-07-20 05:28:15,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949189540] [2022-07-20 05:28:15,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:28:15,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-20 05:28:15,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:28:15,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-20 05:28:15,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2022-07-20 05:28:15,664 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:16,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:28:16,307 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-07-20 05:28:16,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 05:28:16,307 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 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 41 [2022-07-20 05:28:16,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:28:16,308 INFO L225 Difference]: With dead ends: 56 [2022-07-20 05:28:16,308 INFO L226 Difference]: Without dead ends: 56 [2022-07-20 05:28:16,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=417, Invalid=1839, Unknown=0, NotChecked=0, Total=2256 [2022-07-20 05:28:16,309 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 193 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:28:16,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 217 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:28:16,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-20 05:28:16,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-07-20 05:28:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:16,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-07-20 05:28:16,311 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 41 [2022-07-20 05:28:16,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:28:16,311 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-07-20 05:28:16,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-07-20 05:28:16,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-20 05:28:16,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:28:16,312 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:28:16,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 05:28:16,535 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,SelfDestructingSolverStorable25 [2022-07-20 05:28:16,536 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:28:16,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:28:16,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1595560281, now seen corresponding path program 5 times [2022-07-20 05:28:16,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:28:16,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806496854] [2022-07-20 05:28:16,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:28:16,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:28:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:28:16,899 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:16,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:28:16,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806496854] [2022-07-20 05:28:16,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806496854] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:28:16,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646347016] [2022-07-20 05:28:16,900 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:28:16,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:16,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:28:16,901 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:28:16,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 05:28:17,049 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-20 05:28:17,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:28:17,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-20 05:28:17,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:28:17,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:28:17,215 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-20 05:28:17,357 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-20 05:28:17,431 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-20 05:28:17,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:28:17,459 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-20 05:28:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:17,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:28:17,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-20 05:28:17,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:28:17,490 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_441) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:28:17,497 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:17,507 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_440) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:17,513 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:17,518 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-20 05:28:17,522 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:17,527 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:28:17,528 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-20 05:28:17,534 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:28:17,534 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-20 05:28:17,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:28:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 29 not checked. [2022-07-20 05:28:17,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646347016] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:28:17,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:28:17,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 43 [2022-07-20 05:28:17,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373543297] [2022-07-20 05:28:17,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:28:17,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-20 05:28:17,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:28:17,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-20 05:28:17,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1095, Unknown=8, NotChecked=584, Total=1806 [2022-07-20 05:28:17,720 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:18,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:28:18,244 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2022-07-20 05:28:18,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 05:28:18,245 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 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 47 [2022-07-20 05:28:18,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:28:18,246 INFO L225 Difference]: With dead ends: 88 [2022-07-20 05:28:18,246 INFO L226 Difference]: Without dead ends: 63 [2022-07-20 05:28:18,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 68 SyntacticMatches, 12 SemanticMatches, 49 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=178, Invalid=1652, Unknown=8, NotChecked=712, Total=2550 [2022-07-20 05:28:18,247 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:28:18,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 475 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 403 Invalid, 0 Unknown, 280 Unchecked, 0.1s Time] [2022-07-20 05:28:18,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-20 05:28:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2022-07-20 05:28:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-07-20 05:28:18,250 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 47 [2022-07-20 05:28:18,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:28:18,250 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-07-20 05:28:18,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:18,250 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-07-20 05:28:18,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 05:28:18,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:28:18,251 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:28:18,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 05:28:18,475 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,SelfDestructingSolverStorable26 [2022-07-20 05:28:18,476 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:28:18,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:28:18,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1297179492, now seen corresponding path program 6 times [2022-07-20 05:28:18,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:28:18,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844178956] [2022-07-20 05:28:18,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:28:18,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:28:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:28:18,694 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:18,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:28:18,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844178956] [2022-07-20 05:28:18,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844178956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:28:18,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127191842] [2022-07-20 05:28:18,695 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:28:18,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:18,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:28:18,700 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:28:18,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 05:28:18,825 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-20 05:28:18,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:28:18,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-20 05:28:18,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:28:18,839 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:28:18,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:28:19,114 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:19,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:28:19,526 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:19,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127191842] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:28:19,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:28:19,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 35 [2022-07-20 05:28:19,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157983032] [2022-07-20 05:28:19,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:28:19,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-20 05:28:19,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:28:19,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-20 05:28:19,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1102, Unknown=0, NotChecked=0, Total=1260 [2022-07-20 05:28:19,528 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 36 states, 35 states have (on average 3.942857142857143) internal successors, (138), 36 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:20,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:28:20,007 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-07-20 05:28:20,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 05:28:20,008 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.942857142857143) internal successors, (138), 36 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-20 05:28:20,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:28:20,008 INFO L225 Difference]: With dead ends: 61 [2022-07-20 05:28:20,008 INFO L226 Difference]: Without dead ends: 61 [2022-07-20 05:28:20,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=460, Invalid=1892, Unknown=0, NotChecked=0, Total=2352 [2022-07-20 05:28:20,009 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 221 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:28:20,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 263 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:28:20,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-20 05:28:20,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-07-20 05:28:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-07-20 05:28:20,011 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 51 [2022-07-20 05:28:20,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:28:20,011 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-07-20 05:28:20,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.942857142857143) internal successors, (138), 36 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-07-20 05:28:20,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-20 05:28:20,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:28:20,012 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:28:20,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-20 05:28:20,212 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,SelfDestructingSolverStorable27 [2022-07-20 05:28:20,213 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:28:20,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:28:20,213 INFO L85 PathProgramCache]: Analyzing trace with hash -351804326, now seen corresponding path program 7 times [2022-07-20 05:28:20,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:28:20,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152539479] [2022-07-20 05:28:20,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:28:20,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:28:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:28:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:20,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:28:20,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152539479] [2022-07-20 05:28:20,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152539479] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:28:20,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034271006] [2022-07-20 05:28:20,671 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:28:20,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:20,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:28:20,672 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:28:20,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 05:28:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:28:20,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-20 05:28:20,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:28:20,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 10 treesize of output 8 [2022-07-20 05:28:21,001 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-20 05:28:21,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 17 treesize of output 19 [2022-07-20 05:28:21,277 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-20 05:28:21,334 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-20 05:28:21,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:28:21,367 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-20 05:28:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:21,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:28:21,382 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-20 05:28:21,387 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:28:21,397 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_547) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:28:21,409 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:21,419 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_546) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:21,425 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:21,434 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_545) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:21,447 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:28:21,451 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src#1.offset| 4)) 0)) is different from false [2022-07-20 05:28:21,456 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:28:21,465 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:28:21,465 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-20 05:28:21,471 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:28:21,472 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-20 05:28:21,474 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-20 05:28:21,692 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 51 not checked. [2022-07-20 05:28:21,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034271006] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:28:21,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:28:21,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 22] total 51 [2022-07-20 05:28:21,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449187427] [2022-07-20 05:28:21,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:28:21,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-20 05:28:21,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:28:21,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-20 05:28:21,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1529, Unknown=10, NotChecked=870, Total=2550 [2022-07-20 05:28:21,695 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 51 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:22,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:28:22,517 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-07-20 05:28:22,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 05:28:22,517 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-07-20 05:28:22,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:28:22,518 INFO L225 Difference]: With dead ends: 98 [2022-07-20 05:28:22,518 INFO L226 Difference]: Without dead ends: 67 [2022-07-20 05:28:22,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 85 SyntacticMatches, 12 SemanticMatches, 60 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=213, Invalid=2469, Unknown=10, NotChecked=1090, Total=3782 [2022-07-20 05:28:22,519 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 520 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:28:22,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 611 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 690 Invalid, 0 Unknown, 520 Unchecked, 0.3s Time] [2022-07-20 05:28:22,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-20 05:28:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2022-07-20 05:28:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 63 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2022-07-20 05:28:22,521 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 57 [2022-07-20 05:28:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:28:22,521 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2022-07-20 05:28:22,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-07-20 05:28:22,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-20 05:28:22,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:28:22,522 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:28:22,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-20 05:28:22,722 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,SelfDestructingSolverStorable28 [2022-07-20 05:28:22,723 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:28:22,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:28:22,723 INFO L85 PathProgramCache]: Analyzing trace with hash -841664547, now seen corresponding path program 8 times [2022-07-20 05:28:22,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:28:22,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570031776] [2022-07-20 05:28:22,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:28:22,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:28:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:28:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:22,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:28:22,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570031776] [2022-07-20 05:28:22,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570031776] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:28:22,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130152314] [2022-07-20 05:28:22,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:28:22,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:22,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:28:22,965 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:28:22,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-20 05:28:23,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:28:23,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:28:23,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-20 05:28:23,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:28:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:23,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:28:23,690 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-20 05:28:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:23,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130152314] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:28:23,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:28:23,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 36 [2022-07-20 05:28:23,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236718714] [2022-07-20 05:28:23,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:28:23,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-20 05:28:23,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:28:23,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-20 05:28:23,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1203, Unknown=0, NotChecked=0, Total=1332 [2022-07-20 05:28:23,724 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 37 states, 36 states have (on average 3.4166666666666665) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:24,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:28:24,427 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2022-07-20 05:28:24,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:28:24,427 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.4166666666666665) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 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 61 [2022-07-20 05:28:24,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:28:24,427 INFO L225 Difference]: With dead ends: 72 [2022-07-20 05:28:24,427 INFO L226 Difference]: Without dead ends: 72 [2022-07-20 05:28:24,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=593, Invalid=2487, Unknown=0, NotChecked=0, Total=3080 [2022-07-20 05:28:24,428 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 554 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:28:24,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 330 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:28:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-20 05:28:24,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-07-20 05:28:24,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.044776119402985) internal successors, (70), 68 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-07-20 05:28:24,431 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 61 [2022-07-20 05:28:24,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:28:24,431 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-07-20 05:28:24,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.4166666666666665) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-07-20 05:28:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-20 05:28:24,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:28:24,431 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:28:24,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-20 05:28:24,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:24,632 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:28:24,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:28:24,632 INFO L85 PathProgramCache]: Analyzing trace with hash -321797194, now seen corresponding path program 3 times [2022-07-20 05:28:24,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:28:24,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503694075] [2022-07-20 05:28:24,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:28:24,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:28:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:28:25,018 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 26 proven. 49 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-20 05:28:25,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:28:25,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503694075] [2022-07-20 05:28:25,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503694075] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:28:25,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029469615] [2022-07-20 05:28:25,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:28:25,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:25,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:28:25,024 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:28:25,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 05:28:25,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-20 05:28:25,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:28:25,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 119 conjunts are in the unsatisfiable core [2022-07-20 05:28:25,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:28:25,267 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:28:25,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:28:25,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:28:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-20 05:28:25,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:28:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-20 05:28:26,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029469615] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:28:26,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:28:26,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 51 [2022-07-20 05:28:26,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809504503] [2022-07-20 05:28:26,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:28:26,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-20 05:28:26,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:28:26,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-20 05:28:26,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=2375, Unknown=0, NotChecked=0, Total=2652 [2022-07-20 05:28:26,807 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:28,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:28:28,250 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-07-20 05:28:28,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-20 05:28:28,251 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 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 62 [2022-07-20 05:28:28,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:28:28,251 INFO L225 Difference]: With dead ends: 70 [2022-07-20 05:28:28,251 INFO L226 Difference]: Without dead ends: 70 [2022-07-20 05:28:28,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1677 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=764, Invalid=5556, Unknown=0, NotChecked=0, Total=6320 [2022-07-20 05:28:28,253 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 113 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:28:28,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 259 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:28:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-20 05:28:28,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-07-20 05:28:28,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0298507462686568) 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-20 05:28:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2022-07-20 05:28:28,256 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 62 [2022-07-20 05:28:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:28:28,256 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2022-07-20 05:28:28,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-07-20 05:28:28,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-20 05:28:28,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:28:28,257 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:28:28,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-20 05:28:28,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:28,464 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:28:28,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:28:28,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1711491803, now seen corresponding path program 9 times [2022-07-20 05:28:28,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:28:28,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571231658] [2022-07-20 05:28:28,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:28:28,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:28:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:28:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:29,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:28:29,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571231658] [2022-07-20 05:28:29,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571231658] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:28:29,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645102996] [2022-07-20 05:28:29,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:28:29,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:29,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:28:29,131 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:28:29,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-20 05:28:29,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-20 05:28:29,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:28:29,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 155 conjunts are in the unsatisfiable core [2022-07-20 05:28:29,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:28:29,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 10 treesize of output 8 [2022-07-20 05:28:29,693 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-20 05:28:29,924 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-20 05:28:30,067 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-20 05:28:30,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 16 treesize of output 18 [2022-07-20 05:28:30,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 16 treesize of output 18 [2022-07-20 05:28:30,553 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-20 05:28:30,686 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:28:30,688 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:28:30,688 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-20 05:28:30,692 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:30,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:28:30,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-20 05:28:30,710 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:28:30,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_726) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:28:30,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:30,740 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_725 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_725) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-20 05:28:30,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:30,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_724) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:30,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:28:30,772 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_723 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_723) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:28:30,779 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:30,784 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-20 05:28:30,788 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:30,793 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:28:30,793 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-20 05:28:30,798 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:28:30,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-20 05:28:30,802 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-20 05:28:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 79 not checked. [2022-07-20 05:28:31,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645102996] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:28:31,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:28:31,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25, 25] total 72 [2022-07-20 05:28:31,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704493739] [2022-07-20 05:28:31,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:28:31,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-20 05:28:31,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:28:31,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-20 05:28:31,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3357, Unknown=12, NotChecked=1524, Total=5112 [2022-07-20 05:28:31,164 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 72 states, 72 states have (on average 2.4444444444444446) internal successors, (176), 72 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:28:32,119 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2022-07-20 05:28:32,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-20 05:28:32,119 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.4444444444444446) internal successors, (176), 72 states have internal predecessors, (176), 0 states have call successors, (0), 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-20 05:28:32,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:28:32,120 INFO L225 Difference]: With dead ends: 112 [2022-07-20 05:28:32,120 INFO L226 Difference]: Without dead ends: 75 [2022-07-20 05:28:32,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 87 ConstructedPredicates, 12 IntricatePredicates, 6 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=346, Invalid=5542, Unknown=12, NotChecked=1932, Total=7832 [2022-07-20 05:28:32,122 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 610 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:28:32,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 822 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 493 Invalid, 0 Unknown, 610 Unchecked, 0.2s Time] [2022-07-20 05:28:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-20 05:28:32,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-07-20 05:28:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.028169014084507) 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-20 05:28:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2022-07-20 05:28:32,124 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 67 [2022-07-20 05:28:32,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:28:32,125 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-07-20 05:28:32,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.4444444444444446) internal successors, (176), 72 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:32,125 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2022-07-20 05:28:32,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-20 05:28:32,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:28:32,125 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:28:32,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-20 05:28:32,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:32,331 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:28:32,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:28:32,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1133270686, now seen corresponding path program 10 times [2022-07-20 05:28:32,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:28:32,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377331956] [2022-07-20 05:28:32,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:28:32,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:28:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:28:32,644 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 28 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:32,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:28:32,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377331956] [2022-07-20 05:28:32,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377331956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:28:32,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413074232] [2022-07-20 05:28:32,645 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:28:32,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:32,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:28:32,648 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:28:32,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-20 05:28:32,941 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:28:32,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:28:32,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-20 05:28:32,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:28:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 45 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:33,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:28:33,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 5 treesize of output 3 [2022-07-20 05:28:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 45 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:33,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413074232] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:28:33,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:28:33,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 41 [2022-07-20 05:28:33,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197367705] [2022-07-20 05:28:33,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:28:33,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-20 05:28:33,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:28:33,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-20 05:28:33,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1542, Unknown=0, NotChecked=0, Total=1722 [2022-07-20 05:28:33,716 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 42 states, 41 states have (on average 3.4878048780487805) internal successors, (143), 42 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-20 05:28:34,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:28:34,345 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-07-20 05:28:34,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 05:28:34,346 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.4878048780487805) internal successors, (143), 42 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 71 [2022-07-20 05:28:34,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:28:34,346 INFO L225 Difference]: With dead ends: 80 [2022-07-20 05:28:34,346 INFO L226 Difference]: Without dead ends: 80 [2022-07-20 05:28:34,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=655, Invalid=2767, Unknown=0, NotChecked=0, Total=3422 [2022-07-20 05:28:34,347 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 294 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:28:34,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 397 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:28:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-20 05:28:34,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2022-07-20 05:28:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2022-07-20 05:28:34,349 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 71 [2022-07-20 05:28:34,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:28:34,349 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2022-07-20 05:28:34,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.4878048780487805) internal successors, (143), 42 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-20 05:28:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-07-20 05:28:34,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-20 05:28:34,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:28:34,353 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:28:34,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-20 05:28:34,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-20 05:28:34,554 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:28:34,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:28:34,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1392415964, now seen corresponding path program 11 times [2022-07-20 05:28:34,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:28:34,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377441402] [2022-07-20 05:28:34,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:28:34,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:28:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:28:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:35,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:28:35,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377441402] [2022-07-20 05:28:35,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377441402] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:28:35,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86834215] [2022-07-20 05:28:35,347 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:28:35,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:35,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:28:35,352 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:28:35,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-20 05:28:35,855 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-07-20 05:28:35,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:28:35,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 135 conjunts are in the unsatisfiable core [2022-07-20 05:28:35,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:28:35,877 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:28:35,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:28:35,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:28:36,224 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-20 05:28:36,432 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-20 05:28:36,590 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-20 05:28:36,735 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-20 05:28:36,872 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-20 05:28:37,038 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-20 05:28:37,202 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-20 05:28:37,357 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:28:37,357 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 17 [2022-07-20 05:28:37,502 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 45 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:37,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:28:38,883 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:28:38,883 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-20 05:28:38,891 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:28:38,892 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-20 05:28:38,898 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-20 05:28:39,588 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 66 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:39,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86834215] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:28:39,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:28:39,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 27, 27] total 86 [2022-07-20 05:28:39,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035554985] [2022-07-20 05:28:39,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:28:39,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-20 05:28:39,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:28:39,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-20 05:28:39,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=6862, Unknown=5, NotChecked=0, Total=7310 [2022-07-20 05:28:39,591 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 86 states, 86 states have (on average 2.5930232558139537) internal successors, (223), 86 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:41,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:28:41,884 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2022-07-20 05:28:41,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-07-20 05:28:41,885 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 2.5930232558139537) internal successors, (223), 86 states have internal predecessors, (223), 0 states have call successors, (0), 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 77 [2022-07-20 05:28:41,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:28:41,885 INFO L225 Difference]: With dead ends: 134 [2022-07-20 05:28:41,885 INFO L226 Difference]: Without dead ends: 91 [2022-07-20 05:28:41,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2550 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1102, Invalid=14895, Unknown=5, NotChecked=0, Total=16002 [2022-07-20 05:28:41,887 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 208 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:28:41,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1039 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 490 Invalid, 0 Unknown, 383 Unchecked, 0.2s Time] [2022-07-20 05:28:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-20 05:28:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2022-07-20 05:28:41,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.0229885057471264) 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-20 05:28:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2022-07-20 05:28:41,893 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 77 [2022-07-20 05:28:41,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:28:41,894 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-07-20 05:28:41,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 2.5930232558139537) internal successors, (223), 86 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:41,894 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2022-07-20 05:28:41,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-20 05:28:41,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:28:41,896 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:28:41,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-20 05:28:42,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:42,108 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:28:42,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:28:42,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2138844579, now seen corresponding path program 12 times [2022-07-20 05:28:42,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:28:42,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653972391] [2022-07-20 05:28:42,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:28:42,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:28:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:28:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:42,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:28:42,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653972391] [2022-07-20 05:28:42,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653972391] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:28:42,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569145996] [2022-07-20 05:28:42,916 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:28:42,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:42,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:28:42,924 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:28:42,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-20 05:28:43,247 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-07-20 05:28:43,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:28:43,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 193 conjunts are in the unsatisfiable core [2022-07-20 05:28:43,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:28:43,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:28:43,709 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-20 05:28:43,921 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-20 05:28:44,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-20 05:28:44,203 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-20 05:28:44,371 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-20 05:28:44,526 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-20 05:28:44,669 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-20 05:28:44,817 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-20 05:28:44,952 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:28:44,953 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:28:44,954 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-20 05:28:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:44,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:28:44,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|))) is different from false [2022-07-20 05:28:44,971 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:28:44,978 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_950) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:28:44,983 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:44,990 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_949) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:44,995 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:45,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_948) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:45,007 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:28:45,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_947 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_947) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:28:45,019 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:45,030 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_946) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:45,036 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:45,049 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_945 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_945) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:45,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:45,061 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-20 05:28:45,065 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 7 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:28:45,069 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:28:45,069 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-20 05:28:45,073 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:28:45,073 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-20 05:28:45,076 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-20 05:28:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 153 not checked. [2022-07-20 05:28:45,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569145996] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:28:45,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:28:45,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 31, 31] total 92 [2022-07-20 05:28:45,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383008156] [2022-07-20 05:28:45,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:28:45,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-07-20 05:28:45,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:28:45,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-07-20 05:28:45,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=5469, Unknown=16, NotChecked=2608, Total=8372 [2022-07-20 05:28:45,558 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 92 states, 92 states have (on average 2.5652173913043477) internal successors, (236), 92 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:47,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:28:47,256 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2022-07-20 05:28:47,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-20 05:28:47,256 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 2.5652173913043477) internal successors, (236), 92 states have internal predecessors, (236), 0 states have call successors, (0), 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 87 [2022-07-20 05:28:47,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:28:47,257 INFO L225 Difference]: With dead ends: 144 [2022-07-20 05:28:47,257 INFO L226 Difference]: Without dead ends: 95 [2022-07-20 05:28:47,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 16 IntricatePredicates, 11 DeprecatedPredicates, 2833 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=487, Invalid=10481, Unknown=16, NotChecked=3536, Total=14520 [2022-07-20 05:28:47,260 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 43 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1393 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:28:47,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1499 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1066 Invalid, 0 Unknown, 1393 Unchecked, 0.4s Time] [2022-07-20 05:28:47,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-20 05:28:47,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2022-07-20 05:28:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2022-07-20 05:28:47,263 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 87 [2022-07-20 05:28:47,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:28:47,264 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2022-07-20 05:28:47,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 2.5652173913043477) internal successors, (236), 92 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:47,264 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2022-07-20 05:28:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-20 05:28:47,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:28:47,265 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:28:47,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-20 05:28:47,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:47,475 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:28:47,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:28:47,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1788632736, now seen corresponding path program 13 times [2022-07-20 05:28:47,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:28:47,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702563564] [2022-07-20 05:28:47,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:28:47,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:28:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:28:47,852 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 66 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:47,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:28:47,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702563564] [2022-07-20 05:28:47,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702563564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:28:47,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52888141] [2022-07-20 05:28:47,852 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:28:47,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:47,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:28:47,854 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:28:47,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-20 05:28:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:28:48,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 90 conjunts are in the unsatisfiable core [2022-07-20 05:28:48,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:28:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 91 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:48,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:28:48,861 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-20 05:28:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 91 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:48,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52888141] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:28:48,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:28:48,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 48 [2022-07-20 05:28:48,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917160726] [2022-07-20 05:28:48,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:28:48,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-20 05:28:48,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:28:48,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-20 05:28:48,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2139, Unknown=0, NotChecked=0, Total=2352 [2022-07-20 05:28:48,909 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand has 49 states, 48 states have (on average 3.8125) internal successors, (183), 49 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:50,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:28:50,115 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-07-20 05:28:50,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-20 05:28:50,115 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 3.8125) internal successors, (183), 49 states have internal predecessors, (183), 0 states have call successors, (0), 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-20 05:28:50,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:28:50,116 INFO L225 Difference]: With dead ends: 100 [2022-07-20 05:28:50,116 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 05:28:50,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1130, Invalid=4722, Unknown=0, NotChecked=0, Total=5852 [2022-07-20 05:28:50,118 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 513 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:28:50,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 676 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 05:28:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 05:28:50,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-07-20 05:28:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 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-20 05:28:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2022-07-20 05:28:50,120 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 91 [2022-07-20 05:28:50,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:28:50,121 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-07-20 05:28:50,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 3.8125) internal successors, (183), 49 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:50,121 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2022-07-20 05:28:50,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-20 05:28:50,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:28:50,122 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:28:50,147 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-20 05:28:50,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:50,336 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:28:50,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:28:50,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1984621730, now seen corresponding path program 14 times [2022-07-20 05:28:50,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:28:50,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3087274] [2022-07-20 05:28:50,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:28:50,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:28:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:28:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 34 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:51,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:28:51,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3087274] [2022-07-20 05:28:51,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3087274] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:28:51,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58118481] [2022-07-20 05:28:51,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:28:51,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:51,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:28:51,329 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-20 05:28:51,330 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-20 05:28:51,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:28:51,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:28:51,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 157 conjunts are in the unsatisfiable core [2022-07-20 05:28:51,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:28:51,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:28:51,826 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-20 05:28:52,105 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-20 05:28:52,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 17 treesize of output 19 [2022-07-20 05:28:52,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 17 treesize of output 19 [2022-07-20 05:28:52,647 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-20 05:28:52,843 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-20 05:28:53,028 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-20 05:28:53,222 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-20 05:28:53,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-20 05:28:53,594 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:28:53,594 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-20 05:28:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 91 proven. 263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:53,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:28:55,560 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| Int)) (or (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| 10) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1123) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) 0))) is different from false [2022-07-20 05:28:55,570 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| Int)) (or (< |c_ULTIMATE.start_cstrncpy_~src#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| 10) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1123) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)))) is different from false [2022-07-20 05:28:55,580 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| Int)) (or (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| 10) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) 0))) is different from false [2022-07-20 05:28:55,588 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:28:55,588 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-20 05:28:55,595 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:28:55,595 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-20 05:28:55,599 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-20 05:28:55,602 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-20 05:28:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 91 proven. 254 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-20 05:28:56,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58118481] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:28:56,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:28:56,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 34, 34] total 108 [2022-07-20 05:28:56,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240776474] [2022-07-20 05:28:56,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:28:56,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-07-20 05:28:56,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:28:56,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-07-20 05:28:56,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=659, Invalid=10263, Unknown=10, NotChecked=624, Total=11556 [2022-07-20 05:28:56,353 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand has 108 states, 108 states have (on average 2.6203703703703702) internal successors, (283), 108 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:29:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:29:00,158 INFO L93 Difference]: Finished difference Result 168 states and 169 transitions. [2022-07-20 05:29:00,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-07-20 05:29:00,159 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 2.6203703703703702) internal successors, (283), 108 states have internal predecessors, (283), 0 states have call successors, (0), 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 97 [2022-07-20 05:29:00,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:29:00,160 INFO L225 Difference]: With dead ends: 168 [2022-07-20 05:29:00,160 INFO L226 Difference]: Without dead ends: 113 [2022-07-20 05:29:00,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 148 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 4058 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1414, Invalid=20050, Unknown=10, NotChecked=876, Total=22350 [2022-07-20 05:29:00,162 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 242 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 870 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:29:00,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1671 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 905 Invalid, 0 Unknown, 870 Unchecked, 0.3s Time] [2022-07-20 05:29:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-20 05:29:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-07-20 05:29:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:29:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2022-07-20 05:29:00,165 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 97 [2022-07-20 05:29:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:29:00,165 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2022-07-20 05:29:00,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 2.6203703703703702) internal successors, (283), 108 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:29:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2022-07-20 05:29:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-20 05:29:00,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:29:00,166 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:29:00,193 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-20 05:29:00,390 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,SelfDestructingSolverStorable36 [2022-07-20 05:29:00,391 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:29:00,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:29:00,391 INFO L85 PathProgramCache]: Analyzing trace with hash -682858529, now seen corresponding path program 15 times [2022-07-20 05:29:00,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:29:00,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848632314] [2022-07-20 05:29:00,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:29:00,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:29:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:29:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:29:01,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:29:01,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848632314] [2022-07-20 05:29:01,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848632314] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:29:01,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726064146] [2022-07-20 05:29:01,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:29:01,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:29:01,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:29:01,658 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-20 05:29:01,659 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-20 05:29:03,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-20 05:29:03,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:29:03,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 229 conjunts are in the unsatisfiable core [2022-07-20 05:29:03,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:29:03,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:29:03,893 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-20 05:29:04,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 16 treesize of output 18 [2022-07-20 05:29:04,288 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-20 05:29:04,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-20 05:29:04,618 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-20 05:29:04,774 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-20 05:29:04,942 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-20 05:29:05,116 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-20 05:29:05,296 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-20 05:29:05,455 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-20 05:29:05,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:29:05,601 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:29:05,601 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-20 05:29:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:29:05,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:29:05,614 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|))) is different from false [2022-07-20 05:29:05,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:29:05,625 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1224 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1224) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:29:05,630 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:05,644 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1223) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:05,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:05,678 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1222) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:05,684 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)))) is different from false [2022-07-20 05:29:05,691 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1221) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:29:05,696 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:05,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1220) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:05,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:05,717 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1219) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:05,725 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-20 05:29:05,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1218) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:05,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-20 05:29:05,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1217) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-20 05:29:05,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:05,768 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-20 05:29:05,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:05,778 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:29:05,778 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-20 05:29:05,784 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:29:05,784 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-20 05:29:05,787 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-20 05:29:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 251 not checked. [2022-07-20 05:29:06,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726064146] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:29:06,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:29:06,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 37, 37] total 112 [2022-07-20 05:29:06,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050019685] [2022-07-20 05:29:06,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:29:06,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-07-20 05:29:06,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:29:06,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-07-20 05:29:06,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=8093, Unknown=20, NotChecked=3980, Total=12432 [2022-07-20 05:29:06,481 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand has 112 states, 112 states have (on average 2.642857142857143) internal successors, (296), 112 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:29:08,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:29:08,708 INFO L93 Difference]: Finished difference Result 176 states and 177 transitions. [2022-07-20 05:29:08,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-20 05:29:08,709 INFO L78 Accepts]: Start accepts. Automaton has has 112 states, 112 states have (on average 2.642857142857143) internal successors, (296), 112 states have internal predecessors, (296), 0 states have call successors, (0), 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 107 [2022-07-20 05:29:08,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:29:08,709 INFO L225 Difference]: With dead ends: 176 [2022-07-20 05:29:08,709 INFO L226 Difference]: Without dead ends: 115 [2022-07-20 05:29:08,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 148 SyntacticMatches, 6 SemanticMatches, 142 ConstructedPredicates, 20 IntricatePredicates, 13 DeprecatedPredicates, 4331 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=574, Invalid=14738, Unknown=20, NotChecked=5260, Total=20592 [2022-07-20 05:29:08,711 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 51 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1670 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:29:08,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1959 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1105 Invalid, 0 Unknown, 1670 Unchecked, 0.4s Time] [2022-07-20 05:29:08,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-20 05:29:08,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2022-07-20 05:29:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.018018018018018) internal successors, (113), 111 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:29:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2022-07-20 05:29:08,714 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 107 [2022-07-20 05:29:08,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:29:08,714 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2022-07-20 05:29:08,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 2.642857142857143) internal successors, (296), 112 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:29:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2022-07-20 05:29:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-20 05:29:08,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:29:08,715 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:29:08,741 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-20 05:29:08,928 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,SelfDestructingSolverStorable37 [2022-07-20 05:29:08,929 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:29:08,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:29:08,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1213254494, now seen corresponding path program 16 times [2022-07-20 05:29:08,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:29:08,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844899762] [2022-07-20 05:29:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:29:08,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:29:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:29:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 120 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:29:09,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:29:09,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844899762] [2022-07-20 05:29:09,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844899762] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:29:09,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303309472] [2022-07-20 05:29:09,397 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:29:09,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:29:09,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:29:09,398 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-20 05:29:09,399 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-20 05:29:10,169 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:29:10,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:29:10,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 116 conjunts are in the unsatisfiable core [2022-07-20 05:29:10,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:29:10,186 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:29:10,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:29:10,946 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 153 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:29:10,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:29:11,979 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 190 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:29:11,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303309472] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:29:11,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:29:11,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 25] total 72 [2022-07-20 05:29:11,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279597133] [2022-07-20 05:29:11,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:29:11,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-07-20 05:29:11,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:29:11,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-07-20 05:29:11,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=4643, Unknown=0, NotChecked=0, Total=5256 [2022-07-20 05:29:11,982 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand has 73 states, 72 states have (on average 4.486111111111111) internal successors, (323), 73 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:29:13,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:29:13,114 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-07-20 05:29:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-20 05:29:13,118 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 4.486111111111111) internal successors, (323), 73 states have internal predecessors, (323), 0 states have call successors, (0), 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 111 [2022-07-20 05:29:13,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:29:13,119 INFO L225 Difference]: With dead ends: 120 [2022-07-20 05:29:13,119 INFO L226 Difference]: Without dead ends: 120 [2022-07-20 05:29:13,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2490 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1756, Invalid=7750, Unknown=0, NotChecked=0, Total=9506 [2022-07-20 05:29:13,120 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 471 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:29:13,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 868 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 05:29:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-20 05:29:13,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2022-07-20 05:29:13,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.017094017094017) internal successors, (119), 117 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:29:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2022-07-20 05:29:13,124 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 111 [2022-07-20 05:29:13,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:29:13,125 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2022-07-20 05:29:13,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 4.486111111111111) internal successors, (323), 73 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:29:13,125 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-07-20 05:29:13,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-20 05:29:13,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:29:13,126 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:29:13,154 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-20 05:29:13,347 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,SelfDestructingSolverStorable38 [2022-07-20 05:29:13,347 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:29:13,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:29:13,348 INFO L85 PathProgramCache]: Analyzing trace with hash 547086304, now seen corresponding path program 17 times [2022-07-20 05:29:13,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:29:13,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573159828] [2022-07-20 05:29:13,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:29:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:29:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:29:14,698 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 42 proven. 500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:29:14,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:29:14,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573159828] [2022-07-20 05:29:14,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573159828] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:29:14,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296060250] [2022-07-20 05:29:14,699 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:29:14,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:29:14,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:29:14,700 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-20 05:29:14,701 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-20 05:29:17,807 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-07-20 05:29:17,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:29:17,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 193 conjunts are in the unsatisfiable core [2022-07-20 05:29:17,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:29:17,835 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:29:17,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:29:17,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:29:18,485 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-20 05:29:18,741 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-20 05:29:18,907 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-20 05:29:19,066 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-20 05:29:19,235 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-20 05:29:19,405 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-20 05:29:19,582 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-20 05:29:19,772 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-20 05:29:19,949 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-20 05:29:20,132 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-20 05:29:20,331 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-20 05:29:20,560 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:29:20,560 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 17 [2022-07-20 05:29:20,774 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 153 proven. 389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:29:20,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:29:23,433 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:29:23,434 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-20 05:29:23,439 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:29:23,440 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-20 05:29:23,442 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-20 05:29:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 190 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:29:24,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296060250] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:29:24,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:29:24,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 39, 39] total 126 [2022-07-20 05:29:24,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284376239] [2022-07-20 05:29:24,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:29:24,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2022-07-20 05:29:24,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:29:24,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2022-07-20 05:29:24,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=829, Invalid=14912, Unknown=9, NotChecked=0, Total=15750 [2022-07-20 05:29:24,724 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand has 126 states, 126 states have (on average 2.7222222222222223) internal successors, (343), 126 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:29:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:29:29,432 INFO L93 Difference]: Finished difference Result 200 states and 201 transitions. [2022-07-20 05:29:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-07-20 05:29:29,433 INFO L78 Accepts]: Start accepts. Automaton has has 126 states, 126 states have (on average 2.7222222222222223) internal successors, (343), 126 states have internal predecessors, (343), 0 states have call successors, (0), 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 117 [2022-07-20 05:29:29,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:29:29,433 INFO L225 Difference]: With dead ends: 200 [2022-07-20 05:29:29,434 INFO L226 Difference]: Without dead ends: 133 [2022-07-20 05:29:29,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5972 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=2064, Invalid=32709, Unknown=9, NotChecked=0, Total=34782 [2022-07-20 05:29:29,435 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 395 mSDsluCounter, 2564 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 2613 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 814 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:29:29,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 2613 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1200 Invalid, 0 Unknown, 814 Unchecked, 0.4s Time] [2022-07-20 05:29:29,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-20 05:29:29,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2022-07-20 05:29:29,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.015748031496063) internal successors, (129), 127 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:29:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2022-07-20 05:29:29,438 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 117 [2022-07-20 05:29:29,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:29:29,438 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2022-07-20 05:29:29,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 126 states have (on average 2.7222222222222223) internal successors, (343), 126 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:29:29,439 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2022-07-20 05:29:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-20 05:29:29,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:29:29,440 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:29:29,453 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-20 05:29:29,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:29:29,650 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:29:29,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:29:29,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1821215585, now seen corresponding path program 18 times [2022-07-20 05:29:29,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:29:29,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294148368] [2022-07-20 05:29:29,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:29:29,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:29:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:29:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 46 proven. 605 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:29:31,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:29:31,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294148368] [2022-07-20 05:29:31,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294148368] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:29:31,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779594318] [2022-07-20 05:29:31,225 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:29:31,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:29:31,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:29:31,226 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-20 05:29:31,226 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-20 05:29:34,419 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-07-20 05:29:34,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:29:34,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 237 conjunts are in the unsatisfiable core [2022-07-20 05:29:34,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:29:34,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:29:35,251 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-20 05:29:35,517 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-20 05:29:35,693 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-20 05:29:35,864 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-20 05:29:36,021 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-20 05:29:36,183 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-20 05:29:36,338 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-20 05:29:36,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 16 treesize of output 18 [2022-07-20 05:29:36,696 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-20 05:29:36,857 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-20 05:29:37,019 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-20 05:29:37,187 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-20 05:29:37,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:29:37,337 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:29:37,338 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-20 05:29:37,341 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 46 proven. 605 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:29:37,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:29:37,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-20 05:29:37,355 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:29:37,362 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1555) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:29:37,368 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-20 05:29:37,380 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1554 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1554) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:37,387 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:37,397 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1553) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:37,404 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:29:37,414 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1552 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1552) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:29:37,420 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:37,429 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1551 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1551) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-20 05:29:37,436 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:37,445 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1550) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:37,451 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:37,459 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1549) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:37,463 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-20 05:29:37,470 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1548) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-20 05:29:37,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:37,483 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1547) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:29:37,488 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-20 05:29:37,498 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1546) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-20 05:29:37,505 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-20 05:29:37,510 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src#1.offset| 11)) 0)) is different from false [2022-07-20 05:29:37,515 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 11)) 0)) is different from false [2022-07-20 05:29:37,520 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:29:37,520 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-20 05:29:37,526 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:29:37,526 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-20 05:29:37,529 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-20 05:29:38,408 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 46 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 373 not checked. [2022-07-20 05:29:38,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779594318] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:29:38,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:29:38,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 43, 43] total 132 [2022-07-20 05:29:38,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059757951] [2022-07-20 05:29:38,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:29:38,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-07-20 05:29:38,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:29:38,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-07-20 05:29:38,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=11229, Unknown=24, NotChecked=5640, Total=17292 [2022-07-20 05:29:38,414 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand has 132 states, 132 states have (on average 2.696969696969697) internal successors, (356), 132 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:29:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:29:41,749 INFO L93 Difference]: Finished difference Result 208 states and 209 transitions. [2022-07-20 05:29:41,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-20 05:29:41,750 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 2.696969696969697) internal successors, (356), 132 states have internal predecessors, (356), 0 states have call successors, (0), 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 127 [2022-07-20 05:29:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:29:41,750 INFO L225 Difference]: With dead ends: 208 [2022-07-20 05:29:41,751 INFO L226 Difference]: Without dead ends: 135 [2022-07-20 05:29:41,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 183 SyntacticMatches, 3 SemanticMatches, 172 ConstructedPredicates, 24 IntricatePredicates, 13 DeprecatedPredicates, 6147 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=697, Invalid=21725, Unknown=24, NotChecked=7656, Total=30102 [2022-07-20 05:29:41,753 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 57 mSDsluCounter, 3046 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 3096 SdHoareTripleChecker+Invalid, 5359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2969 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 05:29:41,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 3096 Invalid, 5359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2369 Invalid, 0 Unknown, 2969 Unchecked, 0.8s Time] [2022-07-20 05:29:41,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-20 05:29:41,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2022-07-20 05:29:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.015267175572519) internal successors, (133), 131 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:29:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2022-07-20 05:29:41,755 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 127 [2022-07-20 05:29:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:29:41,756 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2022-07-20 05:29:41,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 2.696969696969697) internal successors, (356), 132 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:29:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2022-07-20 05:29:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-20 05:29:41,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:29:41,757 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:29:41,766 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-20 05:29:41,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:29:41,964 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:29:41,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:29:41,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1005234012, now seen corresponding path program 19 times [2022-07-20 05:29:41,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:29:41,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290002411] [2022-07-20 05:29:41,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:29:41,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:29:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:29:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 190 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:29:42,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:29:42,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290002411] [2022-07-20 05:29:42,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290002411] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:29:42,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979090363] [2022-07-20 05:29:42,555 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:29:42,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:29:42,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:29:42,556 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-20 05:29:42,556 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-20 05:29:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:29:42,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 126 conjunts are in the unsatisfiable core [2022-07-20 05:29:42,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:29:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 231 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:29:43,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:29:44,059 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-20 05:29:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 231 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:29:44,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979090363] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:29:44,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:29:44,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 31] total 64 [2022-07-20 05:29:44,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589258304] [2022-07-20 05:29:44,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:29:44,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-20 05:29:44,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:29:44,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-20 05:29:44,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=3793, Unknown=0, NotChecked=0, Total=4160 [2022-07-20 05:29:44,127 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand has 65 states, 64 states have (on average 4.109375) internal successors, (263), 65 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:29:46,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:29:46,139 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-07-20 05:29:46,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-20 05:29:46,140 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 4.109375) internal successors, (263), 65 states have internal predecessors, (263), 0 states have call successors, (0), 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 131 [2022-07-20 05:29:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:29:46,141 INFO L225 Difference]: With dead ends: 140 [2022-07-20 05:29:46,141 INFO L226 Difference]: Without dead ends: 140 [2022-07-20 05:29:46,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 225 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2126, Invalid=8794, Unknown=0, NotChecked=0, Total=10920 [2022-07-20 05:29:46,142 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 773 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 05:29:46,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1119 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-20 05:29:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-20 05:29:46,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2022-07-20 05:29:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.0145985401459854) internal successors, (139), 137 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:29:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2022-07-20 05:29:46,145 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 131 [2022-07-20 05:29:46,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:29:46,145 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2022-07-20 05:29:46,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 4.109375) internal successors, (263), 65 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:29:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2022-07-20 05:29:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-20 05:29:46,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:29:46,147 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:29:46,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-07-20 05:29:46,363 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,SelfDestructingSolverStorable41 [2022-07-20 05:29:46,363 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:29:46,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:29:46,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1834780062, now seen corresponding path program 20 times [2022-07-20 05:29:46,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:29:46,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141750749] [2022-07-20 05:29:46,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:29:46,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:29:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:29:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 50 proven. 720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:29:48,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:29:48,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141750749] [2022-07-20 05:29:48,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141750749] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:29:48,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405799104] [2022-07-20 05:29:48,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:29:48,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:29:48,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:29:48,255 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-20 05:29:48,256 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-20 05:29:48,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:29:48,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:29:48,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 219 conjunts are in the unsatisfiable core [2022-07-20 05:29:48,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:29:48,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:29:49,136 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-20 05:29:49,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-20 05:29:49,611 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-20 05:29:49,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-20 05:29:49,951 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-20 05:29:50,124 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-20 05:29:50,305 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-20 05:29:50,477 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-20 05:29:50,656 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-20 05:29:50,839 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-20 05:29:51,046 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-20 05:29:51,237 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-20 05:29:51,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-20 05:29:51,660 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:29:51,660 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 19 treesize of output 19 [2022-07-20 05:29:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 231 proven. 539 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:29:51,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:29:55,228 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-20 05:29:55,232 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:29:55,232 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-20 05:29:55,237 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:29:55,237 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-20 05:29:55,240 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-20 05:29:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 231 proven. 539 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:29:56,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405799104] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:29:56,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:29:56,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 46, 46] total 148 [2022-07-20 05:29:56,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75025616] [2022-07-20 05:29:56,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:29:56,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 148 states [2022-07-20 05:29:56,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:29:56,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2022-07-20 05:29:56,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=20516, Unknown=11, NotChecked=0, Total=21756 [2022-07-20 05:29:56,692 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand has 148 states, 148 states have (on average 2.722972972972973) internal successors, (403), 148 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:30:01,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:30:01,713 INFO L93 Difference]: Finished difference Result 232 states and 233 transitions. [2022-07-20 05:30:01,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-07-20 05:30:01,713 INFO L78 Accepts]: Start accepts. Automaton has has 148 states, 148 states have (on average 2.722972972972973) internal successors, (403), 148 states have internal predecessors, (403), 0 states have call successors, (0), 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 137 [2022-07-20 05:30:01,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:30:01,714 INFO L225 Difference]: With dead ends: 232 [2022-07-20 05:30:01,714 INFO L226 Difference]: Without dead ends: 153 [2022-07-20 05:30:01,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8558 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=2554, Invalid=39665, Unknown=11, NotChecked=0, Total=42230 [2022-07-20 05:30:01,716 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 600 mSDsluCounter, 2579 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1773 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:30:01,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 2636 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1105 Invalid, 0 Unknown, 1773 Unchecked, 0.4s Time] [2022-07-20 05:30:01,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-20 05:30:01,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 148. [2022-07-20 05:30:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.0136054421768708) internal successors, (149), 147 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-20 05:30:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2022-07-20 05:30:01,719 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 137 [2022-07-20 05:30:01,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:30:01,720 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2022-07-20 05:30:01,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 148 states, 148 states have (on average 2.722972972972973) internal successors, (403), 148 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:30:01,720 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2022-07-20 05:30:01,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-20 05:30:01,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:30:01,721 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:30:01,746 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-20 05:30:01,943 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,SelfDestructingSolverStorable42 [2022-07-20 05:30:01,944 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:30:01,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:30:01,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1006091491, now seen corresponding path program 21 times [2022-07-20 05:30:01,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:30:01,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099920261] [2022-07-20 05:30:01,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:30:01,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:30:02,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:30:03,937 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 54 proven. 845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:30:03,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:30:03,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099920261] [2022-07-20 05:30:03,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099920261] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:30:03,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577228624] [2022-07-20 05:30:03,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:30:03,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:30:03,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:30:03,940 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-20 05:30:03,940 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-20 05:30:08,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-07-20 05:30:08,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:30:08,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 305 conjunts are in the unsatisfiable core [2022-07-20 05:30:08,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:30:08,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:30:09,175 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-20 05:30:09,467 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-20 05:30:09,661 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-20 05:30:09,845 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-20 05:30:10,042 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-20 05:30:10,225 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-20 05:30:10,439 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-20 05:30:10,677 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-20 05:30:10,899 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-20 05:30:11,090 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-20 05:30:11,281 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-20 05:30:11,484 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-20 05:30:11,672 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-20 05:30:11,866 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-20 05:30:12,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:30:12,041 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:30:12,041 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-20 05:30:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 54 proven. 845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:30:12,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:30:12,054 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-20 05:30:12,058 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:30:12,065 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1932 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1932) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:30:12,073 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:30:12,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1931 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1931) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:30:12,085 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:30:12,092 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1930) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:30:12,097 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:30:12,104 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1929 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1929) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:30:12,109 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:30:12,117 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1928) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:30:12,122 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:30:12,140 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1927 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1927) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:30:12,145 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-20 05:30:12,152 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1926) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:30:12,157 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-20 05:30:12,164 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1925) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-20 05:30:12,168 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:30:12,175 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1924) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-20 05:30:12,180 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-20 05:30:12,187 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1933 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1923) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-20 05:30:12,192 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-20 05:30:12,199 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1933 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1922) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-20 05:30:12,204 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12)) 0)) is different from false [2022-07-20 05:30:12,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1921 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1921) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12)) 0)) is different from false [2022-07-20 05:30:12,217 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 13)) 0)) is different from false [2022-07-20 05:30:12,220 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src#1.offset| 13)) 0)) is different from false [2022-07-20 05:30:12,224 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 13 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:30:12,227 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:30:12,228 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-20 05:30:12,232 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:30:12,232 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-20 05:30:12,234 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-20 05:30:13,313 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 54 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 519 not checked. [2022-07-20 05:30:13,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577228624] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:30:13,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:30:13,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 49, 49] total 152 [2022-07-20 05:30:13,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301340926] [2022-07-20 05:30:13,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:30:13,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 152 states [2022-07-20 05:30:13,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:30:13,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2022-07-20 05:30:13,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=14877, Unknown=28, NotChecked=7588, Total=22952 [2022-07-20 05:30:13,316 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand has 152 states, 152 states have (on average 2.736842105263158) internal successors, (416), 152 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:30:17,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:30:17,246 INFO L93 Difference]: Finished difference Result 240 states and 241 transitions. [2022-07-20 05:30:17,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-07-20 05:30:17,247 INFO L78 Accepts]: Start accepts. Automaton has has 152 states, 152 states have (on average 2.736842105263158) internal successors, (416), 152 states have internal predecessors, (416), 0 states have call successors, (0), 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 147 [2022-07-20 05:30:17,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:30:17,247 INFO L225 Difference]: With dead ends: 240 [2022-07-20 05:30:17,248 INFO L226 Difference]: Without dead ends: 155 [2022-07-20 05:30:17,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 212 SyntacticMatches, 12 SemanticMatches, 190 ConstructedPredicates, 28 IntricatePredicates, 7 DeprecatedPredicates, 8047 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=735, Invalid=26081, Unknown=28, NotChecked=9828, Total=36672 [2022-07-20 05:30:17,250 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 62 mSDsluCounter, 3543 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 3601 SdHoareTripleChecker+Invalid, 6490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3896 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 05:30:17,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 3601 Invalid, 6490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2570 Invalid, 0 Unknown, 3896 Unchecked, 0.9s Time] [2022-07-20 05:30:17,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-20 05:30:17,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2022-07-20 05:30:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.0132450331125828) internal successors, (153), 151 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:30:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2022-07-20 05:30:17,253 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 147 [2022-07-20 05:30:17,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:30:17,253 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2022-07-20 05:30:17,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 152 states, 152 states have (on average 2.736842105263158) internal successors, (416), 152 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:30:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2022-07-20 05:30:17,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-20 05:30:17,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:30:17,255 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:30:17,270 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-20 05:30:17,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:30:17,468 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:30:17,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:30:17,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1386171046, now seen corresponding path program 22 times [2022-07-20 05:30:17,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:30:17,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419480771] [2022-07-20 05:30:17,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:30:17,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:30:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:30:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 276 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:30:18,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:30:18,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419480771] [2022-07-20 05:30:18,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419480771] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:30:18,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490321180] [2022-07-20 05:30:18,206 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:30:18,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:30:18,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:30:18,207 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-20 05:30:18,208 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-20 05:30:19,410 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:30:19,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:30:19,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 149 conjunts are in the unsatisfiable core [2022-07-20 05:30:19,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:30:20,182 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 325 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:30:20,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:30:20,931 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-20 05:30:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 325 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:30:21,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490321180] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:30:21,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:30:21,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 86 [2022-07-20 05:30:21,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623638029] [2022-07-20 05:30:21,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:30:21,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-07-20 05:30:21,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:30:21,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-07-20 05:30:21,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=6572, Unknown=0, NotChecked=0, Total=7482 [2022-07-20 05:30:21,609 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand has 87 states, 86 states have (on average 4.1976744186046515) internal successors, (361), 87 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:30:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:30:23,357 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-07-20 05:30:23,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-20 05:30:23,359 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 86 states have (on average 4.1976744186046515) internal successors, (361), 87 states have internal predecessors, (361), 0 states have call successors, (0), 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 151 [2022-07-20 05:30:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:30:23,360 INFO L225 Difference]: With dead ends: 160 [2022-07-20 05:30:23,360 INFO L226 Difference]: Without dead ends: 160 [2022-07-20 05:30:23,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3275 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2988, Invalid=11292, Unknown=0, NotChecked=0, Total=14280 [2022-07-20 05:30:23,362 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 796 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 2361 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 05:30:23,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1412 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2361 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-20 05:30:23,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-20 05:30:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-07-20 05:30:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.0127388535031847) internal successors, (159), 157 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:30:23,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2022-07-20 05:30:23,365 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 151 [2022-07-20 05:30:23,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:30:23,365 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2022-07-20 05:30:23,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 86 states have (on average 4.1976744186046515) internal successors, (361), 87 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:30:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2022-07-20 05:30:23,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-20 05:30:23,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:30:23,367 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:30:23,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-07-20 05:30:23,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:30:23,593 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:30:23,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:30:23,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1681679076, now seen corresponding path program 23 times [2022-07-20 05:30:23,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:30:23,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561345954] [2022-07-20 05:30:23,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:30:23,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:30:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:30:25,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 58 proven. 980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:30:25,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:30:25,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561345954] [2022-07-20 05:30:25,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561345954] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:30:25,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807683545] [2022-07-20 05:30:25,641 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:30:25,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:30:25,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:30:25,646 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-20 05:30:25,647 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-20 05:30:47,866 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2022-07-20 05:30:47,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:30:47,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 242 conjunts are in the unsatisfiable core [2022-07-20 05:30:47,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:30:47,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:30:47,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:30:49,017 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-20 05:30:49,449 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-20 05:30:49,696 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-20 05:30:49,941 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-20 05:30:50,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 17 treesize of output 19 [2022-07-20 05:30:50,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 17 treesize of output 19 [2022-07-20 05:30:50,705 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-20 05:30:50,965 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-20 05:30:51,241 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-20 05:30:51,515 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-20 05:30:51,804 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-20 05:30:52,091 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-20 05:30:52,377 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-20 05:30:52,679 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-20 05:30:52,965 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-20 05:30:53,255 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:30:53,255 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-20 05:30:53,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 325 proven. 713 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:30:53,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:30:57,900 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2208) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|))) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)))) is different from false [2022-07-20 05:30:57,909 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| Int)) (or (< |c_ULTIMATE.start_cstrncpy_~src#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_2208) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) 0))) is different from false [2022-07-20 05:30:57,919 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (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_2208) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|))) is different from false [2022-07-20 05:30:57,925 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:30:57,925 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-20 05:30:57,931 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:30:57,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:30:57,934 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-20 05:31:01,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 378 proven. 645 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-20 05:31:01,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807683545] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:31:01,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:31:01,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 52, 52] total 168 [2022-07-20 05:31:01,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896460726] [2022-07-20 05:31:01,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:31:01,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 168 states [2022-07-20 05:31:01,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:31:01,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2022-07-20 05:31:01,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1298, Invalid=25755, Unknown=19, NotChecked=984, Total=28056 [2022-07-20 05:31:01,094 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand has 168 states, 168 states have (on average 2.755952380952381) internal successors, (463), 168 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:31:10,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:31:10,663 INFO L93 Difference]: Finished difference Result 264 states and 265 transitions. [2022-07-20 05:31:10,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-07-20 05:31:10,664 INFO L78 Accepts]: Start accepts. Automaton has has 168 states, 168 states have (on average 2.755952380952381) internal successors, (463), 168 states have internal predecessors, (463), 0 states have call successors, (0), 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 157 [2022-07-20 05:31:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:31:10,665 INFO L225 Difference]: With dead ends: 264 [2022-07-20 05:31:10,665 INFO L226 Difference]: Without dead ends: 173 [2022-07-20 05:31:10,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 247 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 10595 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=3163, Invalid=57100, Unknown=19, NotChecked=1470, Total=61752 [2022-07-20 05:31:10,667 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 627 mSDsluCounter, 4139 mSDsCounter, 0 mSdLazyCounter, 2061 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 4204 SdHoareTripleChecker+Invalid, 4779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2699 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:31:10,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 4204 Invalid, 4779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2061 Invalid, 0 Unknown, 2699 Unchecked, 0.7s Time] [2022-07-20 05:31:10,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-20 05:31:10,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 168. [2022-07-20 05:31:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.0119760479041917) internal successors, (169), 167 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-20 05:31:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2022-07-20 05:31:10,670 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 157 [2022-07-20 05:31:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:31:10,670 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2022-07-20 05:31:10,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 168 states, 168 states have (on average 2.755952380952381) internal successors, (463), 168 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:31:10,671 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2022-07-20 05:31:10,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-20 05:31:10,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:31:10,672 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:31:10,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-07-20 05:31:10,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:31:10,888 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:31:10,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:31:10,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1522236517, now seen corresponding path program 24 times [2022-07-20 05:31:10,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:31:10,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855997057] [2022-07-20 05:31:10,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:31:10,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:31:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:31:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 62 proven. 1125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:31:13,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:31:13,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855997057] [2022-07-20 05:31:13,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855997057] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:31:13,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567409975] [2022-07-20 05:31:13,151 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:31:13,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:31:13,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:31:13,152 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-20 05:31:13,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process