./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.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_cstpncpy-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 36c3a12d89778d96e6058a4f11ff4e1483403bd2fab9b14de640491057c7f753 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:23:42,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:23:42,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:23:42,410 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:23:42,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:23:42,412 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:23:42,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:23:42,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:23:42,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:23:42,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:23:42,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:23:42,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:23:42,430 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:23:42,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:23:42,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:23:42,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:23:42,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:23:42,437 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:23:42,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:23:42,446 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:23:42,448 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:23:42,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:23:42,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:23:42,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:23:42,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:23:42,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:23:42,459 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:23:42,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:23:42,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:23:42,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:23:42,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:23:42,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:23:42,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:23:42,465 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:23:42,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:23:42,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:23:42,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:23:42,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:23:42,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:23:42,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:23:42,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:23:42,471 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:23:42,473 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:23:42,499 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:23:42,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:23:42,500 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:23:42,501 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:23:42,501 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:23:42,501 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:23:42,502 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:23:42,502 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:23:42,503 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:23:42,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:23:42,504 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:23:42,504 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:23:42,504 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:23:42,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:23:42,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:23:42,505 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:23:42,505 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:23:42,505 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:23:42,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:23:42,505 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:23:42,506 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:23:42,506 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:23:42,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:23:42,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:23:42,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:23:42,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:23:42,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:23:42,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:23:42,507 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:23:42,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:23:42,508 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 -> 36c3a12d89778d96e6058a4f11ff4e1483403bd2fab9b14de640491057c7f753 [2022-07-20 05:23:42,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:23:42,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:23:42,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:23:42,798 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:23:42,799 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:23:42,800 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2022-07-20 05:23:42,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2139a7741/c088c42e3e33471e9b398151fd05011d/FLAG3c73ee1c5 [2022-07-20 05:23:43,294 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:23:43,295 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2022-07-20 05:23:43,306 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2139a7741/c088c42e3e33471e9b398151fd05011d/FLAG3c73ee1c5 [2022-07-20 05:23:43,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2139a7741/c088c42e3e33471e9b398151fd05011d [2022-07-20 05:23:43,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:23:43,321 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:23:43,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:23:43,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:23:43,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:23:43,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:23:43" (1/1) ... [2022-07-20 05:23:43,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61c1b67f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:43, skipping insertion in model container [2022-07-20 05:23:43,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:23:43" (1/1) ... [2022-07-20 05:23:43,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:23:43,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:23:43,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:23:43,640 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:23:43,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:23:43,708 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:23:43,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:43 WrapperNode [2022-07-20 05:23:43,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:23:43,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:23:43,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:23:43,713 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:23:43,720 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:23:43" (1/1) ... [2022-07-20 05:23:43,736 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:23:43" (1/1) ... [2022-07-20 05:23:43,764 INFO L137 Inliner]: procedures = 119, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2022-07-20 05:23:43,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:23:43,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:23:43,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:23:43,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:23:43,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:43" (1/1) ... [2022-07-20 05:23:43,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:43" (1/1) ... [2022-07-20 05:23:43,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:43" (1/1) ... [2022-07-20 05:23:43,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:43" (1/1) ... [2022-07-20 05:23:43,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:43" (1/1) ... [2022-07-20 05:23:43,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:43" (1/1) ... [2022-07-20 05:23:43,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:43" (1/1) ... [2022-07-20 05:23:43,791 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:23:43,792 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:23:43,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:23:43,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:23:43,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:43" (1/1) ... [2022-07-20 05:23:43,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:23:43,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:23:43,828 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:23:43,830 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:23:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 05:23:43,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 05:23:43,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:23:43,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 05:23:43,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:23:43,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:23:43,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:23:43,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:23:43,993 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:23:43,994 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:23:44,253 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:23:44,259 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:23:44,260 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 05:23:44,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:23:44 BoogieIcfgContainer [2022-07-20 05:23:44,266 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:23:44,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:23:44,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:23:44,272 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:23:44,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:23:43" (1/3) ... [2022-07-20 05:23:44,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2d989d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:23:44, skipping insertion in model container [2022-07-20 05:23:44,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:43" (2/3) ... [2022-07-20 05:23:44,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2d989d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:23:44, skipping insertion in model container [2022-07-20 05:23:44,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:23:44" (3/3) ... [2022-07-20 05:23:44,276 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca-1.i [2022-07-20 05:23:44,293 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:23:44,293 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-07-20 05:23:44,341 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:23:44,348 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@3ace43e7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@13991177 [2022-07-20 05:23:44,349 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-07-20 05:23:44,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 58 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:23:44,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:23:44,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:44,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:44,376 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:44,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029043, now seen corresponding path program 1 times [2022-07-20 05:23:44,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:44,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24049041] [2022-07-20 05:23:44,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:44,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:44,593 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:23:44,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:44,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24049041] [2022-07-20 05:23:44,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24049041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:44,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:44,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:23:44,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629499413] [2022-07-20 05:23:44,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:44,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:23:44,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:44,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:23:44,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:23:44,643 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 58 states have internal predecessors, (68), 0 states have call successors, (0), 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 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:23:44,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:44,780 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2022-07-20 05:23:44,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:23:44,784 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:23:44,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:44,792 INFO L225 Difference]: With dead ends: 111 [2022-07-20 05:23:44,792 INFO L226 Difference]: Without dead ends: 107 [2022-07-20 05:23:44,794 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:23:44,796 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 106 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:44,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 103 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-20 05:23:44,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 55. [2022-07-20 05:23:44,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 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:23:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-07-20 05:23:44,826 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 7 [2022-07-20 05:23:44,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:44,826 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-07-20 05:23:44,826 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:23:44,827 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-07-20 05:23:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:23:44,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:44,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:44,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 05:23:44,828 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:44,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:44,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029044, now seen corresponding path program 1 times [2022-07-20 05:23:44,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:44,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312185781] [2022-07-20 05:23:44,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:44,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:44,883 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:23:44,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:44,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312185781] [2022-07-20 05:23:44,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312185781] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:44,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:44,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:23:44,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723344363] [2022-07-20 05:23:44,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:44,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:23:44,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:44,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:23:44,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:44,887 INFO L87 Difference]: Start difference. First operand 55 states and 61 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:23:44,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:44,953 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-07-20 05:23:44,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:23:44,954 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:23:44,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:44,958 INFO L225 Difference]: With dead ends: 54 [2022-07-20 05:23:44,959 INFO L226 Difference]: Without dead ends: 54 [2022-07-20 05:23:44,963 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:23:44,965 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 60 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:44,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 83 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-20 05:23:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-07-20 05:23:44,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 53 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:23:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-07-20 05:23:44,982 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 7 [2022-07-20 05:23:44,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:44,983 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-07-20 05:23:44,983 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:23:44,983 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-07-20 05:23:44,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:23:44,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:44,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:44,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 05:23:44,988 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:44,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:44,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029097, now seen corresponding path program 1 times [2022-07-20 05:23:44,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:44,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80361931] [2022-07-20 05:23:44,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:44,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:45,063 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:23:45,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:45,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80361931] [2022-07-20 05:23:45,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80361931] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:45,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:45,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:23:45,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061833554] [2022-07-20 05:23:45,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:45,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:23:45,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:45,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:23:45,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:45,066 INFO L87 Difference]: Start difference. First operand 54 states and 60 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:23:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:45,092 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-07-20 05:23:45,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:23:45,093 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:23:45,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:45,096 INFO L225 Difference]: With dead ends: 101 [2022-07-20 05:23:45,096 INFO L226 Difference]: Without dead ends: 101 [2022-07-20 05:23:45,097 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:23:45,099 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 98 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 112 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:23:45,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 112 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:45,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-20 05:23:45,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 57. [2022-07-20 05:23:45,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 56 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:45,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-07-20 05:23:45,104 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 7 [2022-07-20 05:23:45,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:45,105 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-07-20 05:23:45,105 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:23:45,105 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-07-20 05:23:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:23:45,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:45,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:45,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 05:23:45,106 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:45,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:45,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2022-07-20 05:23:45,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:45,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205275424] [2022-07-20 05:23:45,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:45,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:45,199 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:23:45,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:45,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205275424] [2022-07-20 05:23:45,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205275424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:45,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:45,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:23:45,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178964329] [2022-07-20 05:23:45,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:45,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:23:45,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:45,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:23:45,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:45,204 INFO L87 Difference]: Start difference. First operand 57 states and 64 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:23:45,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:45,291 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-07-20 05:23:45,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:23:45,291 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:23:45,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:45,292 INFO L225 Difference]: With dead ends: 105 [2022-07-20 05:23:45,292 INFO L226 Difference]: Without dead ends: 105 [2022-07-20 05:23:45,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:23:45,302 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 154 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:45,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 69 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-20 05:23:45,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 59. [2022-07-20 05:23:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 58 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:23:45,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2022-07-20 05:23:45,307 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 7 [2022-07-20 05:23:45,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:45,308 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2022-07-20 05:23:45,308 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:23:45,308 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-07-20 05:23:45,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 05:23:45,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:45,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:45,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 05:23:45,309 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:45,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:45,309 INFO L85 PathProgramCache]: Analyzing trace with hash -533877068, now seen corresponding path program 1 times [2022-07-20 05:23:45,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:45,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041306703] [2022-07-20 05:23:45,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:45,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:45,351 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:23:45,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:45,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041306703] [2022-07-20 05:23:45,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041306703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:45,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:45,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:23:45,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233327999] [2022-07-20 05:23:45,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:45,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:23:45,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:45,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:23:45,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:23:45,353 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:45,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:45,385 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-07-20 05:23:45,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:23:45,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-20 05:23:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:45,386 INFO L225 Difference]: With dead ends: 53 [2022-07-20 05:23:45,386 INFO L226 Difference]: Without dead ends: 53 [2022-07-20 05:23:45,387 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:23:45,387 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 36 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:45,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:45,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-20 05:23:45,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-20 05:23:45,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.564102564102564) internal successors, (61), 52 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:23:45,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2022-07-20 05:23:45,392 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 9 [2022-07-20 05:23:45,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:45,392 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2022-07-20 05:23:45,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-07-20 05:23:45,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 05:23:45,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:45,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:45,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 05:23:45,393 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:45,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:45,394 INFO L85 PathProgramCache]: Analyzing trace with hash -533877067, now seen corresponding path program 1 times [2022-07-20 05:23:45,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:45,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750344733] [2022-07-20 05:23:45,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:45,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:45,442 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:23:45,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:45,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750344733] [2022-07-20 05:23:45,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750344733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:45,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:45,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:23:45,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648063127] [2022-07-20 05:23:45,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:45,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:23:45,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:45,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:23:45,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:23:45,444 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:45,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:45,472 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-07-20 05:23:45,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:23:45,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-20 05:23:45,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:45,473 INFO L225 Difference]: With dead ends: 47 [2022-07-20 05:23:45,473 INFO L226 Difference]: Without dead ends: 47 [2022-07-20 05:23:45,474 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:23:45,480 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:45,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 47 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:45,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-20 05:23:45,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-07-20 05:23:45,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 46 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:23:45,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-07-20 05:23:45,490 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 9 [2022-07-20 05:23:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:45,490 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-07-20 05:23:45,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-07-20 05:23:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:23:45,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:45,491 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:45,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 05:23:45,492 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:45,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:45,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2022-07-20 05:23:45,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:45,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416961982] [2022-07-20 05:23:45,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:45,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:45,587 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:23:45,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:45,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416961982] [2022-07-20 05:23:45,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416961982] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:23:45,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300519962] [2022-07-20 05:23:45,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:45,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:45,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:23:45,595 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:23:45,596 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:23:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:45,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 05:23:45,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:45,817 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:23:45,818 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:23:45,878 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:23:45,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:46,072 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:23:46,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300519962] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:46,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:23:46,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-07-20 05:23:46,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749751556] [2022-07-20 05:23:46,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:46,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:23:46,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:46,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:23:46,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:23:46,080 INFO L87 Difference]: Start difference. First operand 47 states and 55 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:23:46,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:46,229 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2022-07-20 05:23:46,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:23:46,230 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:23:46,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:46,231 INFO L225 Difference]: With dead ends: 83 [2022-07-20 05:23:46,231 INFO L226 Difference]: Without dead ends: 83 [2022-07-20 05:23:46,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:23:46,232 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 62 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:46,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 128 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:46,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-20 05:23:46,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 44. [2022-07-20 05:23:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:46,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-07-20 05:23:46,236 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 11 [2022-07-20 05:23:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:46,236 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-07-20 05:23:46,236 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:23:46,236 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-07-20 05:23:46,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:23:46,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:46,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:46,266 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:23:46,438 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:23:46,438 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:46,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:46,439 INFO L85 PathProgramCache]: Analyzing trace with hash 229648597, now seen corresponding path program 1 times [2022-07-20 05:23:46,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:46,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586801698] [2022-07-20 05:23:46,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:46,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:46,512 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:23:46,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:46,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586801698] [2022-07-20 05:23:46,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586801698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:46,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:46,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:23:46,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68429252] [2022-07-20 05:23:46,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:46,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:23:46,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:46,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:23:46,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:23:46,515 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:46,571 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2022-07-20 05:23:46,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:23:46,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-20 05:23:46,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:46,573 INFO L225 Difference]: With dead ends: 94 [2022-07-20 05:23:46,573 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 05:23:46,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:23:46,577 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 104 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:46,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 183 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:46,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 05:23:46,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 56. [2022-07-20 05:23:46,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-07-20 05:23:46,581 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 15 [2022-07-20 05:23:46,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:46,581 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-07-20 05:23:46,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-07-20 05:23:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:23:46,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:46,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:46,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 05:23:46,583 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:46,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:46,583 INFO L85 PathProgramCache]: Analyzing trace with hash 487814035, now seen corresponding path program 1 times [2022-07-20 05:23:46,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:46,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612276560] [2022-07-20 05:23:46,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:46,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:46,682 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:23:46,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:46,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612276560] [2022-07-20 05:23:46,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612276560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:46,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:46,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:23:46,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075823737] [2022-07-20 05:23:46,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:46,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:23:46,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:46,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:23:46,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:23:46,686 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:46,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:46,728 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-07-20 05:23:46,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:23:46,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-20 05:23:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:46,729 INFO L225 Difference]: With dead ends: 67 [2022-07-20 05:23:46,730 INFO L226 Difference]: Without dead ends: 67 [2022-07-20 05:23:46,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:23:46,731 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 156 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:46,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 83 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-20 05:23:46,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2022-07-20 05:23:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:23:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-07-20 05:23:46,734 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 15 [2022-07-20 05:23:46,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:46,735 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-07-20 05:23:46,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-07-20 05:23:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 05:23:46,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:46,735 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:23:46,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 05:23:46,736 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:46,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:46,736 INFO L85 PathProgramCache]: Analyzing trace with hash -994678340, now seen corresponding path program 1 times [2022-07-20 05:23:46,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:46,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252695404] [2022-07-20 05:23:46,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:46,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:46,877 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:23:46,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:46,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252695404] [2022-07-20 05:23:46,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252695404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:46,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:46,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:23:46,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691014295] [2022-07-20 05:23:46,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:46,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:23:46,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:46,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:23:46,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:23:46,881 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 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:23:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:46,971 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-07-20 05:23:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:23:46,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 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:23:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:46,973 INFO L225 Difference]: With dead ends: 43 [2022-07-20 05:23:46,973 INFO L226 Difference]: Without dead ends: 43 [2022-07-20 05:23:46,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:23:46,974 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 131 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:46,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 73 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:46,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-20 05:23:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-20 05:23:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-07-20 05:23:46,986 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 18 [2022-07-20 05:23:46,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:46,987 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-07-20 05:23:46,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 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:23:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-07-20 05:23:46,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 05:23:46,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:46,988 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:23:46,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 05:23:46,989 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:46,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:46,989 INFO L85 PathProgramCache]: Analyzing trace with hash -994678339, now seen corresponding path program 1 times [2022-07-20 05:23:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:46,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144537059] [2022-07-20 05:23:46,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:46,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:47,168 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:23:47,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:47,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144537059] [2022-07-20 05:23:47,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144537059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:47,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:47,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:23:47,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593944771] [2022-07-20 05:23:47,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:47,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:23:47,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:47,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:23:47,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:23:47,174 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 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:23:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:47,351 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-07-20 05:23:47,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:23:47,352 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 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:23:47,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:47,352 INFO L225 Difference]: With dead ends: 49 [2022-07-20 05:23:47,352 INFO L226 Difference]: Without dead ends: 49 [2022-07-20 05:23:47,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-07-20 05:23:47,353 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 157 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:47,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 86 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-20 05:23:47,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-07-20 05:23:47,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-07-20 05:23:47,359 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 18 [2022-07-20 05:23:47,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:47,360 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-07-20 05:23:47,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 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:23:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-07-20 05:23:47,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 05:23:47,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:47,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:47,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 05:23:47,362 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:47,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:47,362 INFO L85 PathProgramCache]: Analyzing trace with hash -770257435, now seen corresponding path program 1 times [2022-07-20 05:23:47,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:47,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356080951] [2022-07-20 05:23:47,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:47,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:47,499 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:23:47,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:47,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356080951] [2022-07-20 05:23:47,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356080951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:47,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:47,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:23:47,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779240663] [2022-07-20 05:23:47,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:47,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:23:47,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:47,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:23:47,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:23:47,501 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:47,663 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-07-20 05:23:47,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:23:47,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-20 05:23:47,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:47,664 INFO L225 Difference]: With dead ends: 48 [2022-07-20 05:23:47,664 INFO L226 Difference]: Without dead ends: 48 [2022-07-20 05:23:47,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-07-20 05:23:47,665 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 79 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:47,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 155 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:47,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-20 05:23:47,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-07-20 05:23:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.325) internal successors, (53), 45 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:23:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-07-20 05:23:47,667 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 19 [2022-07-20 05:23:47,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:47,667 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-07-20 05:23:47,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-07-20 05:23:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 05:23:47,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:47,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:47,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 05:23:47,668 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:47,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:47,669 INFO L85 PathProgramCache]: Analyzing trace with hash -770257436, now seen corresponding path program 1 times [2022-07-20 05:23:47,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:47,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178611796] [2022-07-20 05:23:47,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:47,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:47,833 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:23:47,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:47,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178611796] [2022-07-20 05:23:47,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178611796] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:47,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:47,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 05:23:47,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278002012] [2022-07-20 05:23:47,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:47,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:23:47,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:47,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:23:47,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:23:47,835 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:48,373 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-07-20 05:23:48,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:23:48,373 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-20 05:23:48,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:48,374 INFO L225 Difference]: With dead ends: 85 [2022-07-20 05:23:48,374 INFO L226 Difference]: Without dead ends: 85 [2022-07-20 05:23:48,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2022-07-20 05:23:48,375 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 244 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:48,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 157 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:23:48,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-20 05:23:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 45. [2022-07-20 05:23:48,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.275) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:48,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-07-20 05:23:48,377 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 19 [2022-07-20 05:23:48,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:48,377 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-07-20 05:23:48,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-07-20 05:23:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 05:23:48,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:48,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:48,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 05:23:48,378 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:48,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:48,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1682807689, now seen corresponding path program 1 times [2022-07-20 05:23:48,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:48,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626967550] [2022-07-20 05:23:48,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:48,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:48,422 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:23:48,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:48,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626967550] [2022-07-20 05:23:48,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626967550] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:48,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:48,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:23:48,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074508584] [2022-07-20 05:23:48,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:48,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:23:48,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:48,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:23:48,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:23:48,426 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:48,476 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-07-20 05:23:48,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:23:48,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 05:23:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:48,477 INFO L225 Difference]: With dead ends: 44 [2022-07-20 05:23:48,477 INFO L226 Difference]: Without dead ends: 44 [2022-07-20 05:23:48,477 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:23:48,478 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:48,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 95 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:48,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-20 05:23:48,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-07-20 05:23:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 0 states 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:23:48,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-07-20 05:23:48,480 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 24 [2022-07-20 05:23:48,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:48,480 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-07-20 05:23:48,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:48,480 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-07-20 05:23:48,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 05:23:48,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:48,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:48,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 05:23:48,481 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:48,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:48,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1682807690, now seen corresponding path program 1 times [2022-07-20 05:23:48,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:48,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584916152] [2022-07-20 05:23:48,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:48,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:48,560 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:23:48,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:48,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584916152] [2022-07-20 05:23:48,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584916152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:48,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:48,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:23:48,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714405784] [2022-07-20 05:23:48,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:48,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:23:48,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:48,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:23:48,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:23:48,562 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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:23:48,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:48,615 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2022-07-20 05:23:48,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:23:48,616 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 05:23:48,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:48,616 INFO L225 Difference]: With dead ends: 88 [2022-07-20 05:23:48,616 INFO L226 Difference]: Without dead ends: 88 [2022-07-20 05:23:48,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:23:48,617 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 75 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:48,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 199 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:48,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-20 05:23:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2022-07-20 05:23:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-07-20 05:23:48,620 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 24 [2022-07-20 05:23:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:48,620 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-07-20 05:23:48,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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:23:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-07-20 05:23:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 05:23:48,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:48,621 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, 1, 1, 1] [2022-07-20 05:23:48,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 05:23:48,621 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:48,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:48,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1703829822, now seen corresponding path program 1 times [2022-07-20 05:23:48,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:48,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562888853] [2022-07-20 05:23:48,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:48,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:48,704 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:23:48,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:48,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562888853] [2022-07-20 05:23:48,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562888853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:48,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:48,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:23:48,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155418272] [2022-07-20 05:23:48,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:48,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:23:48,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:48,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:23:48,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:23:48,705 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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:23:48,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:48,768 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-07-20 05:23:48,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:23:48,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 05:23:48,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:48,769 INFO L225 Difference]: With dead ends: 75 [2022-07-20 05:23:48,769 INFO L226 Difference]: Without dead ends: 75 [2022-07-20 05:23:48,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:23:48,769 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:48,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 182 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:48,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-20 05:23:48,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-07-20 05:23:48,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2022-07-20 05:23:48,772 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 24 [2022-07-20 05:23:48,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:48,772 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2022-07-20 05:23:48,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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:23:48,772 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-07-20 05:23:48,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 05:23:48,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:48,773 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:48,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 05:23:48,773 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:48,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:48,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2105509516, now seen corresponding path program 1 times [2022-07-20 05:23:48,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:48,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882925486] [2022-07-20 05:23:48,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:48,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:49,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:23:49,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:49,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882925486] [2022-07-20 05:23:49,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882925486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:49,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:49,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-20 05:23:49,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738765842] [2022-07-20 05:23:49,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:49,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 05:23:49,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:49,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 05:23:49,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:23:49,161 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 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:23:49,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:49,686 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-07-20 05:23:49,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 05:23:49,687 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 05:23:49,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:49,689 INFO L225 Difference]: With dead ends: 77 [2022-07-20 05:23:49,689 INFO L226 Difference]: Without dead ends: 77 [2022-07-20 05:23:49,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2022-07-20 05:23:49,690 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 90 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:49,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 165 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:23:49,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-20 05:23:49,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-07-20 05:23:49,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 74 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:23:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2022-07-20 05:23:49,693 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 24 [2022-07-20 05:23:49,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:49,693 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-07-20 05:23:49,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 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:23:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-07-20 05:23:49,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 05:23:49,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:49,694 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, 1, 1, 1] [2022-07-20 05:23:49,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 05:23:49,694 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:49,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:49,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2126531648, now seen corresponding path program 1 times [2022-07-20 05:23:49,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:49,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368793367] [2022-07-20 05:23:49,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:49,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:49,846 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:23:49,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:49,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368793367] [2022-07-20 05:23:49,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368793367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:49,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:49,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 05:23:49,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518685430] [2022-07-20 05:23:49,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:49,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 05:23:49,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:49,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 05:23:49,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:23:49,848 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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:23:50,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:50,081 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2022-07-20 05:23:50,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 05:23:50,082 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 05:23:50,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:50,083 INFO L225 Difference]: With dead ends: 120 [2022-07-20 05:23:50,083 INFO L226 Difference]: Without dead ends: 120 [2022-07-20 05:23:50,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-07-20 05:23:50,084 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 61 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:50,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 253 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-20 05:23:50,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2022-07-20 05:23:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 102 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:23:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2022-07-20 05:23:50,087 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 24 [2022-07-20 05:23:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:50,087 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2022-07-20 05:23:50,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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:23:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-07-20 05:23:50,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 05:23:50,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:50,088 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, 1, 1, 1] [2022-07-20 05:23:50,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 05:23:50,088 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:50,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:50,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1949580930, now seen corresponding path program 1 times [2022-07-20 05:23:50,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:50,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061013641] [2022-07-20 05:23:50,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:50,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:50,272 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:23:50,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:50,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061013641] [2022-07-20 05:23:50,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061013641] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:50,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:50,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 05:23:50,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429631399] [2022-07-20 05:23:50,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:50,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:23:50,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:50,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:23:50,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:23:50,275 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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:23:50,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:50,515 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2022-07-20 05:23:50,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:23:50,516 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 05:23:50,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:50,517 INFO L225 Difference]: With dead ends: 156 [2022-07-20 05:23:50,517 INFO L226 Difference]: Without dead ends: 156 [2022-07-20 05:23:50,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-07-20 05:23:50,518 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 100 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:50,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 188 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:50,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-20 05:23:50,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 105. [2022-07-20 05:23:50,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:23:50,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-07-20 05:23:50,521 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 24 [2022-07-20 05:23:50,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:50,522 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-07-20 05:23:50,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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:23:50,522 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-07-20 05:23:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:23:50,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:50,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:50,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 05:23:50,523 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:50,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:50,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1664467980, now seen corresponding path program 1 times [2022-07-20 05:23:50,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:50,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122982095] [2022-07-20 05:23:50,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:50,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:50,744 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:23:50,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:50,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122982095] [2022-07-20 05:23:50,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122982095] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:50,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:50,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:23:50,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671429435] [2022-07-20 05:23:50,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:50,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:23:50,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:50,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:23:50,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:23:50,746 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:50,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:50,785 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2022-07-20 05:23:50,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:23:50,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 05:23:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:50,786 INFO L225 Difference]: With dead ends: 104 [2022-07-20 05:23:50,787 INFO L226 Difference]: Without dead ends: 59 [2022-07-20 05:23:50,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:23:50,787 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:50,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 77 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:50,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-20 05:23:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-07-20 05:23:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-07-20 05:23:50,790 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 27 [2022-07-20 05:23:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:50,790 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-07-20 05:23:50,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-07-20 05:23:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 05:23:50,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:50,791 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, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:50,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 05:23:50,791 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:50,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:50,792 INFO L85 PathProgramCache]: Analyzing trace with hash 235701316, now seen corresponding path program 1 times [2022-07-20 05:23:50,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:50,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479995878] [2022-07-20 05:23:50,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:50,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:51,229 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:23:51,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:51,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479995878] [2022-07-20 05:23:51,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479995878] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:23:51,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195128492] [2022-07-20 05:23:51,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:51,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:51,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:23:51,232 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:23:51,233 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:23:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:51,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-20 05:23:51,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:51,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:51,391 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:23:51,403 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:23:51,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:23:51,470 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:23:51,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:23:51,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:23:51,510 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 11 treesize of output 7 [2022-07-20 05:23:51,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:23:51,596 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 25 treesize of output 13 [2022-07-20 05:23:51,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-07-20 05:23:52,090 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:23:52,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:52,893 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:23:52,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195128492] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:52,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:23:52,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2022-07-20 05:23:52,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679453555] [2022-07-20 05:23:52,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:52,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-20 05:23:52,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:52,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-20 05:23:52,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1574, Unknown=0, NotChecked=0, Total=1722 [2022-07-20 05:23:52,898 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 42 states, 41 states have (on average 1.853658536585366) internal successors, (76), 42 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:53,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:53,370 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-07-20 05:23:53,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 05:23:53,370 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.853658536585366) internal successors, (76), 42 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-20 05:23:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:53,371 INFO L225 Difference]: With dead ends: 68 [2022-07-20 05:23:53,371 INFO L226 Difference]: Without dead ends: 68 [2022-07-20 05:23:53,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=237, Invalid=2213, Unknown=0, NotChecked=0, Total=2450 [2022-07-20 05:23:53,372 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:53,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 230 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 171 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2022-07-20 05:23:53,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-20 05:23:53,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-07-20 05:23:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 64 states have (on average 1.125) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states 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:23:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2022-07-20 05:23:53,375 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 28 [2022-07-20 05:23:53,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:53,375 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2022-07-20 05:23:53,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.853658536585366) internal successors, (76), 42 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-07-20 05:23:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 05:23:53,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:53,375 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:53,403 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:23:53,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-20 05:23:53,584 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:53,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:53,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1959516773, now seen corresponding path program 1 times [2022-07-20 05:23:53,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:53,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444506057] [2022-07-20 05:23:53,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:53,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:53,776 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:23:53,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:53,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444506057] [2022-07-20 05:23:53,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444506057] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:23:53,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999674823] [2022-07-20 05:23:53,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:53,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:53,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:23:53,778 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:23:53,780 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:23:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:53,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-20 05:23:53,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:53,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:53,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:23:53,970 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:23:53,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:23:54,072 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:23:54,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:54,292 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 27 treesize of output 23 [2022-07-20 05:23:54,367 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:23:54,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:23:54,381 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:23:54,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999674823] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:54,381 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:23:54,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-07-20 05:23:54,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473994652] [2022-07-20 05:23:54,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:54,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-20 05:23:54,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:54,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-20 05:23:54,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2022-07-20 05:23:54,383 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:23:54,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:54,886 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2022-07-20 05:23:54,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:23:54,887 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 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 28 [2022-07-20 05:23:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:54,887 INFO L225 Difference]: With dead ends: 99 [2022-07-20 05:23:54,887 INFO L226 Difference]: Without dead ends: 99 [2022-07-20 05:23:54,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2022-07-20 05:23:54,888 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 470 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:54,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 305 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 418 Invalid, 0 Unknown, 36 Unchecked, 0.3s Time] [2022-07-20 05:23:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-20 05:23:54,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 71. [2022-07-20 05:23:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 70 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-07-20 05:23:54,891 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 28 [2022-07-20 05:23:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:54,891 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-07-20 05:23:54,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:23:54,891 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-07-20 05:23:54,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 05:23:54,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:54,891 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:54,920 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:23:55,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:55,100 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:55,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:55,100 INFO L85 PathProgramCache]: Analyzing trace with hash -615477817, now seen corresponding path program 1 times [2022-07-20 05:23:55,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:55,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730014288] [2022-07-20 05:23:55,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:55,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:55,489 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:23:55,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:55,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730014288] [2022-07-20 05:23:55,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730014288] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:23:55,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658547688] [2022-07-20 05:23:55,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:55,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:55,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:23:55,492 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:23:55,518 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:23:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:55,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-20 05:23:55,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:55,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:55,624 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:23:55,627 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:23:55,689 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:23:55,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-20 05:23:55,727 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 11 treesize of output 7 [2022-07-20 05:23:55,746 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 11 treesize of output 7 [2022-07-20 05:23:55,856 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 25 treesize of output 13 [2022-07-20 05:23:55,862 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:23:56,337 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:23:56,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:56,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:23:57,051 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:23:57,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658547688] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:57,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:23:57,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 38 [2022-07-20 05:23:57,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496909029] [2022-07-20 05:23:57,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:57,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-20 05:23:57,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:57,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-20 05:23:57,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2022-07-20 05:23:57,055 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 39 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 39 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:23:58,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:58,054 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-07-20 05:23:58,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:23:58,054 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 39 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 05:23:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:58,055 INFO L225 Difference]: With dead ends: 72 [2022-07-20 05:23:58,055 INFO L226 Difference]: Without dead ends: 72 [2022-07-20 05:23:58,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=278, Invalid=1978, Unknown=0, NotChecked=0, Total=2256 [2022-07-20 05:23:58,056 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:58,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 334 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 202 Invalid, 0 Unknown, 92 Unchecked, 0.2s Time] [2022-07-20 05:23:58,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-20 05:23:58,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-20 05:23:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-07-20 05:23:58,059 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 29 [2022-07-20 05:23:58,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:58,059 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-07-20 05:23:58,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 39 states have internal predecessors, (80), 0 states have call successors, (0), 0 states 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:23:58,059 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-07-20 05:23:58,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 05:23:58,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:58,060 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:58,087 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:23:58,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:58,261 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:23:58,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:58,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1510311704, now seen corresponding path program 1 times [2022-07-20 05:23:58,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:58,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549719878] [2022-07-20 05:23:58,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:58,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:58,776 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:23:58,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:58,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549719878] [2022-07-20 05:23:58,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549719878] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:23:58,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006871036] [2022-07-20 05:23:58,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:58,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:58,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:23:58,778 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:23:58,779 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:23:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:58,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-20 05:23:58,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:58,940 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:23:58,941 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:23:58,958 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:23:58,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:23:59,115 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:23:59,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-20 05:23:59,136 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 05:23:59,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:23:59,181 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 11 treesize of output 7 [2022-07-20 05:23:59,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:23:59,273 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 25 treesize of output 13 [2022-07-20 05:23:59,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-07-20 05:23:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:59,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:00,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:24:00,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:24:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:00,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006871036] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:00,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:00,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 46 [2022-07-20 05:24:00,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852031609] [2022-07-20 05:24:00,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:00,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-20 05:24:00,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:00,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-20 05:24:00,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2026, Unknown=0, NotChecked=0, Total=2162 [2022-07-20 05:24:00,884 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 47 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 47 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:24:04,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:04,832 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-07-20 05:24:04,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-20 05:24:04,832 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 47 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 05:24:04,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:04,833 INFO L225 Difference]: With dead ends: 92 [2022-07-20 05:24:04,833 INFO L226 Difference]: Without dead ends: 92 [2022-07-20 05:24:04,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=652, Invalid=5668, Unknown=0, NotChecked=0, Total=6320 [2022-07-20 05:24:04,835 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 259 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:04,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 541 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 844 Invalid, 0 Unknown, 206 Unchecked, 0.7s Time] [2022-07-20 05:24:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-20 05:24:04,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2022-07-20 05:24:04,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 77 states have (on average 1.155844155844156) internal successors, (89), 79 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:24:04,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-07-20 05:24:04,838 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 34 [2022-07-20 05:24:04,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:04,838 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-07-20 05:24:04,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 47 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:24:04,839 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-07-20 05:24:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 05:24:04,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:04,839 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:04,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-20 05:24:05,059 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,SelfDestructingSolverStorable23 [2022-07-20 05:24:05,060 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:24:05,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:05,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1489289572, now seen corresponding path program 2 times [2022-07-20 05:24:05,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:05,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518310465] [2022-07-20 05:24:05,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:05,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:05,439 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:24:05,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:05,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518310465] [2022-07-20 05:24:05,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518310465] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:05,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615464303] [2022-07-20 05:24:05,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:24:05,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:05,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:05,444 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:24:05,445 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:24:05,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:24:05,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:05,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-20 05:24:05,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:05,596 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:24:05,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:24:05,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:24:05,760 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:24:05,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:24:05,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:24:05,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:05,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 8 [2022-07-20 05:24:05,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:24:06,040 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:24:06,051 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:24:06,054 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:24:06,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:06,068 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_916 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-20 05:24:06,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_916 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:06,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:06,092 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 1)))) is different from false [2022-07-20 05:24:06,100 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:06,107 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:06,113 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:06,122 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_27| Int) (v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (or (= 0 (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_27| v_ArrVal_915) |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_27|) 0)))) is different from false [2022-07-20 05:24:06,129 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:06,129 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 26 treesize of output 27 [2022-07-20 05:24:06,136 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:06,137 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 141 treesize of output 135 [2022-07-20 05:24:06,150 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 59 treesize of output 51 [2022-07-20 05:24:06,157 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 110 treesize of output 94 [2022-07-20 05:24:06,470 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-20 05:24:06,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615464303] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:06,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:06,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 42 [2022-07-20 05:24:06,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598876982] [2022-07-20 05:24:06,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:06,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-20 05:24:06,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:06,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-20 05:24:06,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1024, Unknown=8, NotChecked=568, Total=1722 [2022-07-20 05:24:06,472 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:07,683 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-07-20 05:24:07,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 05:24:07,683 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 05:24:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:07,686 INFO L225 Difference]: With dead ends: 126 [2022-07-20 05:24:07,686 INFO L226 Difference]: Without dead ends: 126 [2022-07-20 05:24:07,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=246, Invalid=2129, Unknown=9, NotChecked=808, Total=3192 [2022-07-20 05:24:07,688 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 53 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 710 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:07,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 626 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 341 Invalid, 0 Unknown, 710 Unchecked, 0.2s Time] [2022-07-20 05:24:07,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-20 05:24:07,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 104. [2022-07-20 05:24:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 101 states have (on average 1.1386138613861385) internal successors, (115), 103 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:24:07,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2022-07-20 05:24:07,691 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 34 [2022-07-20 05:24:07,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:07,691 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2022-07-20 05:24:07,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2022-07-20 05:24:07,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 05:24:07,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:07,692 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:07,712 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:24:07,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:07,900 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:24:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:07,900 INFO L85 PathProgramCache]: Analyzing trace with hash -412898380, now seen corresponding path program 2 times [2022-07-20 05:24:07,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:07,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460185531] [2022-07-20 05:24:07,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:07,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:08,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:08,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460185531] [2022-07-20 05:24:08,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460185531] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:08,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030396129] [2022-07-20 05:24:08,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:24:08,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:08,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:08,344 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:24:08,369 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:24:08,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:24:08,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:08,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-20 05:24:08,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:08,541 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:24:08,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:24:08,546 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:24:08,635 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:24:08,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-20 05:24:08,650 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 05:24:08,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:08,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:08,690 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 11 treesize of output 7 [2022-07-20 05:24:08,755 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 25 treesize of output 13 [2022-07-20 05:24:08,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-07-20 05:24:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:09,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:10,117 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:10,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030396129] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:10,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:10,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 54 [2022-07-20 05:24:10,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291718870] [2022-07-20 05:24:10,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:10,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-20 05:24:10,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:10,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-20 05:24:10,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=2722, Unknown=0, NotChecked=0, Total=2970 [2022-07-20 05:24:10,120 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 55 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 55 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:24:12,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:12,374 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-07-20 05:24:12,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-20 05:24:12,375 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 55 states have internal predecessors, (96), 0 states have call successors, (0), 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 36 [2022-07-20 05:24:12,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:12,375 INFO L225 Difference]: With dead ends: 129 [2022-07-20 05:24:12,375 INFO L226 Difference]: Without dead ends: 58 [2022-07-20 05:24:12,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=837, Invalid=7719, Unknown=0, NotChecked=0, Total=8556 [2022-07-20 05:24:12,377 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 257 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:12,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 605 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1120 Invalid, 0 Unknown, 56 Unchecked, 0.7s Time] [2022-07-20 05:24:12,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-20 05:24:12,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2022-07-20 05:24:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.12) internal successors, (56), 52 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-07-20 05:24:12,380 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 36 [2022-07-20 05:24:12,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:12,380 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-07-20 05:24:12,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 55 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:24:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-07-20 05:24:12,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 05:24:12,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:12,381 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:12,400 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:24:12,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:12,584 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:24:12,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:12,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1201741191, now seen corresponding path program 3 times [2022-07-20 05:24:12,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:12,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399952666] [2022-07-20 05:24:12,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:12,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:12,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:12,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399952666] [2022-07-20 05:24:12,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399952666] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:12,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3473834] [2022-07-20 05:24:12,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:24:12,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:12,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:12,796 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:24:12,798 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:24:12,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-20 05:24:12,984 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:12,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-20 05:24:12,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:13,001 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:24:13,001 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:24:13,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:24:13,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:24:13,091 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:24:13,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:24:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:13,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:13,473 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 27 treesize of output 23 [2022-07-20 05:24:13,632 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:13,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3473834] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:13,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:13,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2022-07-20 05:24:13,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814306005] [2022-07-20 05:24:13,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:13,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-20 05:24:13,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:13,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-20 05:24:13,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2022-07-20 05:24:13,634 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 33 states, 32 states have (on average 3.0) internal successors, (96), 33 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:24:14,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:14,117 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-07-20 05:24:14,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 05:24:14,117 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.0) internal successors, (96), 33 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 05:24:14,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:14,117 INFO L225 Difference]: With dead ends: 54 [2022-07-20 05:24:14,117 INFO L226 Difference]: Without dead ends: 54 [2022-07-20 05:24:14,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=245, Invalid=1647, Unknown=0, NotChecked=0, Total=1892 [2022-07-20 05:24:14,119 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 280 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:14,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 226 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 325 Invalid, 0 Unknown, 82 Unchecked, 0.2s Time] [2022-07-20 05:24:14,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-20 05:24:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-07-20 05:24:14,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.1) internal successors, (55), 52 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:24:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-07-20 05:24:14,121 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 38 [2022-07-20 05:24:14,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:14,121 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-07-20 05:24:14,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.0) internal successors, (96), 33 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:24:14,122 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-07-20 05:24:14,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 05:24:14,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:14,122 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:14,147 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:24:14,343 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,SelfDestructingSolverStorable26 [2022-07-20 05:24:14,343 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:24:14,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:14,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1400728745, now seen corresponding path program 2 times [2022-07-20 05:24:14,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:14,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405976953] [2022-07-20 05:24:14,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:14,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:14,947 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:24:14,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:14,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405976953] [2022-07-20 05:24:14,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405976953] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:14,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45011548] [2022-07-20 05:24:14,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:24:14,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:14,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:14,949 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:24:14,974 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:24:15,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:24:15,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:15,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-20 05:24:15,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:15,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:24:15,129 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:24:15,136 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:24:15,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:24:15,199 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:24:15,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:24:15,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:24:15,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:15,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:15,343 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 25 treesize of output 13 [2022-07-20 05:24:15,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-07-20 05:24:15,853 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:24:15,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:16,720 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:24:16,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45011548] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:16,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:16,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 46 [2022-07-20 05:24:16,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974388430] [2022-07-20 05:24:16,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:16,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-20 05:24:16,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:16,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-20 05:24:16,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1999, Unknown=0, NotChecked=0, Total=2162 [2022-07-20 05:24:16,722 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 47 states, 46 states have (on average 2.108695652173913) internal successors, (97), 47 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:17,567 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-07-20 05:24:17,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 05:24:17,567 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.108695652173913) internal successors, (97), 47 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-20 05:24:17,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:17,567 INFO L225 Difference]: With dead ends: 59 [2022-07-20 05:24:17,567 INFO L226 Difference]: Without dead ends: 59 [2022-07-20 05:24:17,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=337, Invalid=3445, Unknown=0, NotChecked=0, Total=3782 [2022-07-20 05:24:17,569 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:17,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 266 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 264 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2022-07-20 05:24:17,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-20 05:24:17,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-07-20 05:24:17,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 57 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:24:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-07-20 05:24:17,571 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 39 [2022-07-20 05:24:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:17,571 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-07-20 05:24:17,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.108695652173913) internal successors, (97), 47 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-07-20 05:24:17,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 05:24:17,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:17,572 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:17,593 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:24:17,779 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,SelfDestructingSolverStorable27 [2022-07-20 05:24:17,779 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:24:17,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:17,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1072669446, now seen corresponding path program 4 times [2022-07-20 05:24:17,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:17,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10151443] [2022-07-20 05:24:17,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:17,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:18,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:18,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10151443] [2022-07-20 05:24:18,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10151443] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:18,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556573643] [2022-07-20 05:24:18,392 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:24:18,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:18,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:18,393 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:24:18,394 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:24:18,681 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:24:18,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:18,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-20 05:24:18,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:18,692 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:24:18,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 05:24:18,919 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:24:18,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:24:18,967 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:24:18,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:19,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 8 [2022-07-20 05:24:19,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:24:19,342 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:24:19,469 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:24:19,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:24:19,580 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:19,580 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:24:19,610 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:24:19,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:19,674 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1365 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1365) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-20 05:24:19,679 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1365 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1365) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:19,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1364) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1365) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:20,052 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:20,052 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 26 treesize of output 27 [2022-07-20 05:24:20,058 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:20,058 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 141 treesize of output 135 [2022-07-20 05:24:20,063 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 118 treesize of output 102 [2022-07-20 05:24:20,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2022-07-20 05:24:20,488 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:20,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 51 [2022-07-20 05:24:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-20 05:24:20,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556573643] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:20,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:20,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 62 [2022-07-20 05:24:20,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421246752] [2022-07-20 05:24:20,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:20,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-07-20 05:24:20,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:20,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-07-20 05:24:20,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3236, Unknown=6, NotChecked=348, Total=3782 [2022-07-20 05:24:20,556 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 62 states, 62 states have (on average 1.8709677419354838) internal successors, (116), 62 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:24:20,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:20,885 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2022-07-20 05:24:20,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:24:20,886 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.8709677419354838) internal successors, (116), 62 states have internal predecessors, (116), 0 states have call successors, (0), 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 44 [2022-07-20 05:24:20,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:20,886 INFO L225 Difference]: With dead ends: 91 [2022-07-20 05:24:20,886 INFO L226 Difference]: Without dead ends: 65 [2022-07-20 05:24:20,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=231, Invalid=3681, Unknown=6, NotChecked=372, Total=4290 [2022-07-20 05:24:20,888 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:20,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 791 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 278 Unchecked, 0.1s Time] [2022-07-20 05:24:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-20 05:24:20,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2022-07-20 05:24:20,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 61 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:20,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-07-20 05:24:20,890 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 44 [2022-07-20 05:24:20,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:20,890 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-07-20 05:24:20,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.8709677419354838) internal successors, (116), 62 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:24:20,891 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-07-20 05:24:20,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-20 05:24:20,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:20,891 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:20,909 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:24:21,095 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,SelfDestructingSolverStorable28 [2022-07-20 05:24:21,095 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:24:21,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:21,096 INFO L85 PathProgramCache]: Analyzing trace with hash 682791063, now seen corresponding path program 5 times [2022-07-20 05:24:21,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:21,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973681982] [2022-07-20 05:24:21,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:21,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:21,335 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:24:21,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:21,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973681982] [2022-07-20 05:24:21,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973681982] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:21,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754963101] [2022-07-20 05:24:21,336 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:24:21,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:21,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:21,337 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:24:21,338 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:24:21,832 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-20 05:24:21,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:21,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-20 05:24:21,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:21,855 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:24:21,855 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:24:21,868 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:24:21,869 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:24:21,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:24:21,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:24:21,996 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:24:21,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:24:22,113 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:24:22,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:22,691 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:24:22,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754963101] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:22,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:22,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 34 [2022-07-20 05:24:22,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017614462] [2022-07-20 05:24:22,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:22,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-20 05:24:22,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:22,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-20 05:24:22,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1053, Unknown=0, NotChecked=0, Total=1190 [2022-07-20 05:24:22,693 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 35 states, 34 states have (on average 3.735294117647059) internal successors, (127), 35 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:23,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:23,160 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-07-20 05:24:23,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:24:23,161 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.735294117647059) internal successors, (127), 35 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-07-20 05:24:23,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:23,161 INFO L225 Difference]: With dead ends: 63 [2022-07-20 05:24:23,161 INFO L226 Difference]: Without dead ends: 63 [2022-07-20 05:24:23,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=410, Invalid=1752, Unknown=0, NotChecked=0, Total=2162 [2022-07-20 05:24:23,162 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 278 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:23,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 224 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 401 Invalid, 0 Unknown, 10 Unchecked, 0.2s Time] [2022-07-20 05:24:23,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-20 05:24:23,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-07-20 05:24:23,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 61 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:23,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2022-07-20 05:24:23,165 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 48 [2022-07-20 05:24:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:23,165 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2022-07-20 05:24:23,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.735294117647059) internal successors, (127), 35 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2022-07-20 05:24:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-20 05:24:23,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:23,166 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:23,187 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:24:23,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:23,379 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:24:23,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:23,380 INFO L85 PathProgramCache]: Analyzing trace with hash 337884900, now seen corresponding path program 2 times [2022-07-20 05:24:23,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:23,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403131648] [2022-07-20 05:24:23,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:23,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 05:24:23,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:23,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403131648] [2022-07-20 05:24:23,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403131648] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:23,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932948815] [2022-07-20 05:24:23,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:24:23,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:23,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:23,982 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:24:23,983 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:24:24,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:24:24,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:24,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-20 05:24:24,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:24,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:24:24,195 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:24:24,202 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:24:24,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:24:24,339 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:24:24,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-20 05:24:24,353 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 05:24:24,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:24,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:24,390 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 11 treesize of output 7 [2022-07-20 05:24:24,450 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 25 treesize of output 13 [2022-07-20 05:24:24,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-07-20 05:24:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 05:24:24,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-20 05:24:25,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932948815] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:25,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:25,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 53 [2022-07-20 05:24:25,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525887299] [2022-07-20 05:24:25,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:25,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-20 05:24:25,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:25,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-20 05:24:25,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2657, Unknown=0, NotChecked=0, Total=2862 [2022-07-20 05:24:25,863 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 54 states, 53 states have (on average 2.452830188679245) internal successors, (130), 54 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:24:28,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:28,846 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2022-07-20 05:24:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-20 05:24:28,846 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.452830188679245) internal successors, (130), 54 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 54 [2022-07-20 05:24:28,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:28,847 INFO L225 Difference]: With dead ends: 116 [2022-07-20 05:24:28,847 INFO L226 Difference]: Without dead ends: 96 [2022-07-20 05:24:28,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2411 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1006, Invalid=9500, Unknown=0, NotChecked=0, Total=10506 [2022-07-20 05:24:28,848 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 210 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:28,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 404 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 664 Invalid, 0 Unknown, 44 Unchecked, 0.4s Time] [2022-07-20 05:24:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-20 05:24:28,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2022-07-20 05:24:28,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 86 states have internal predecessors, (96), 0 states have call successors, (0), 0 states 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:24:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2022-07-20 05:24:28,850 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 54 [2022-07-20 05:24:28,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:28,850 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2022-07-20 05:24:28,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.452830188679245) internal successors, (130), 54 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:24:28,851 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2022-07-20 05:24:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-20 05:24:28,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:28,851 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:28,873 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:24:29,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:29,059 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:24:29,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:29,060 INFO L85 PathProgramCache]: Analyzing trace with hash 358907032, now seen corresponding path program 6 times [2022-07-20 05:24:29,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:29,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787370321] [2022-07-20 05:24:29,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:29,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:29,660 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:24:29,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:29,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787370321] [2022-07-20 05:24:29,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787370321] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:29,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141639738] [2022-07-20 05:24:29,660 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:24:29,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:29,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:29,662 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:24:29,662 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:24:29,978 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-20 05:24:29,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:29,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 96 conjunts are in the unsatisfiable core [2022-07-20 05:24:29,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:29,994 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:24:29,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:24:30,214 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:24:30,269 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 05:24:30,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:30,317 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:24:30,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:30,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 24 treesize of output 12 [2022-07-20 05:24:30,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:24:30,655 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:24:30,738 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:24:30,756 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:24:30,764 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:24:30,768 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:24:30,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:30,781 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-20 05:24:30,787 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:30,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1793 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1793) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:30,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-20 05:24:30,814 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1792 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1792) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-20 05:24:30,820 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-20 05:24:30,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-20 05:24:30,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 3)) 0)) is different from false [2022-07-20 05:24:30,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 3)) 0)) is different from false [2022-07-20 05:24:30,838 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 3)) 0)) is different from false [2022-07-20 05:24:30,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 3)) 0)) is different from false [2022-07-20 05:24:30,893 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:30,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-20 05:24:30,899 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:30,899 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 141 treesize of output 135 [2022-07-20 05:24:30,902 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 118 treesize of output 102 [2022-07-20 05:24:30,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2022-07-20 05:24:31,406 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:24:31,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141639738] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:31,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:31,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 23] total 60 [2022-07-20 05:24:31,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019852126] [2022-07-20 05:24:31,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:31,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-07-20 05:24:31,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:31,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-07-20 05:24:31,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2223, Unknown=11, NotChecked=1144, Total=3540 [2022-07-20 05:24:31,409 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 60 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:24:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:32,339 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2022-07-20 05:24:32,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 05:24:32,340 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 60 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-07-20 05:24:32,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:32,343 INFO L225 Difference]: With dead ends: 126 [2022-07-20 05:24:32,343 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 05:24:32,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=258, Invalid=3807, Unknown=11, NotChecked=1474, Total=5550 [2022-07-20 05:24:32,346 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 36 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 698 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:32,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 895 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 623 Invalid, 0 Unknown, 698 Unchecked, 0.2s Time] [2022-07-20 05:24:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 05:24:32,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-07-20 05:24:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 90 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-07-20 05:24:32,351 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 54 [2022-07-20 05:24:32,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:32,351 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-07-20 05:24:32,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 60 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:24:32,352 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-07-20 05:24:32,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-20 05:24:32,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:32,352 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:32,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:32,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-07-20 05:24:32,563 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:24:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:32,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2070188021, now seen corresponding path program 7 times [2022-07-20 05:24:32,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:32,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146490422] [2022-07-20 05:24:32,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:32,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:32,863 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:24:32,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:32,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146490422] [2022-07-20 05:24:32,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146490422] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:32,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410765799] [2022-07-20 05:24:32,864 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:24:32,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:32,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:32,865 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:24:32,866 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:24:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:33,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-20 05:24:33,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:33,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:24:33,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:24:33,189 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:24:33,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:24:33,322 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:24:33,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:33,692 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 27 treesize of output 23 [2022-07-20 05:24:33,945 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:24:33,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:24:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:33,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410765799] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:33,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:33,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 44 [2022-07-20 05:24:33,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336110193] [2022-07-20 05:24:33,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:33,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-20 05:24:33,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:33,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-20 05:24:33,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1790, Unknown=0, NotChecked=0, Total=1980 [2022-07-20 05:24:33,949 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:34,565 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-07-20 05:24:34,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 05:24:34,566 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-20 05:24:34,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:34,566 INFO L225 Difference]: With dead ends: 92 [2022-07-20 05:24:34,566 INFO L226 Difference]: Without dead ends: 92 [2022-07-20 05:24:34,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=638, Invalid=2784, Unknown=0, NotChecked=0, Total=3422 [2022-07-20 05:24:34,567 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 497 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:34,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 370 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 631 Invalid, 0 Unknown, 57 Unchecked, 0.3s Time] [2022-07-20 05:24:34,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-20 05:24:34,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-07-20 05:24:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 88 states have (on average 1.125) internal successors, (99), 90 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:24:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-07-20 05:24:34,570 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 58 [2022-07-20 05:24:34,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:34,570 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-07-20 05:24:34,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-07-20 05:24:34,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-20 05:24:34,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:34,571 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:34,591 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:24:34,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:34,779 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:24:34,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash -248680787, now seen corresponding path program 3 times [2022-07-20 05:24:34,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:34,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279310330] [2022-07-20 05:24:34,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:34,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-20 05:24:35,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:35,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279310330] [2022-07-20 05:24:35,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279310330] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:35,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743561362] [2022-07-20 05:24:35,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:24:35,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:35,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:35,199 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:24:35,199 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:24:35,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-20 05:24:35,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:35,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 119 conjunts are in the unsatisfiable core [2022-07-20 05:24:35,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:35,850 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:24:35,851 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:24:35,861 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:24:35,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:24:36,023 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 05:24:36,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:36,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:24:36,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:36,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:36,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 17 [2022-07-20 05:24:36,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:24:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-20 05:24:36,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:37,656 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-20 05:24:37,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743561362] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:37,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:37,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 56 [2022-07-20 05:24:37,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950999085] [2022-07-20 05:24:37,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:37,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-20 05:24:37,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:37,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-20 05:24:37,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2941, Unknown=0, NotChecked=0, Total=3192 [2022-07-20 05:24:37,660 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 57 states, 56 states have (on average 2.375) internal successors, (133), 57 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:24:39,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:39,964 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-07-20 05:24:39,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-20 05:24:39,964 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.375) internal successors, (133), 57 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) Word has length 59 [2022-07-20 05:24:39,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:39,965 INFO L225 Difference]: With dead ends: 90 [2022-07-20 05:24:39,965 INFO L226 Difference]: Without dead ends: 90 [2022-07-20 05:24:39,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=910, Invalid=6746, Unknown=0, NotChecked=0, Total=7656 [2022-07-20 05:24:39,965 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 168 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:39,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 337 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 905 Invalid, 0 Unknown, 3 Unchecked, 0.5s Time] [2022-07-20 05:24:39,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-20 05:24:39,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-20 05:24:39,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.0681818181818181) internal successors, (94), 89 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-07-20 05:24:39,969 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 59 [2022-07-20 05:24:39,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:39,969 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-07-20 05:24:39,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.375) internal successors, (133), 57 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:24:39,970 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-07-20 05:24:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-20 05:24:39,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:39,970 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:39,990 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:24:40,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:40,176 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:24:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:40,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1595605642, now seen corresponding path program 8 times [2022-07-20 05:24:40,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:40,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659212910] [2022-07-20 05:24:40,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:40,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:40,897 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:24:40,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:40,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659212910] [2022-07-20 05:24:40,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659212910] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:40,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247142014] [2022-07-20 05:24:40,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:24:40,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:40,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:40,900 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:24:40,903 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:24:41,127 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:24:41,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:41,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-20 05:24:41,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:41,144 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:24:41,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:24:41,385 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:24:41,440 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:24:41,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:24:41,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:41,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:24:41,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 8 [2022-07-20 05:24:41,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:24:41,820 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:24:41,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:24:41,969 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:24:41,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:24:41,997 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:24:42,000 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:24:42,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:42,010 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-20 05:24:42,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:42,024 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2267) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:42,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-20 05:24:42,036 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2266 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2266) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-20 05:24:42,049 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-20 05:24:42,056 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2265 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2265) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-20 05:24:42,061 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:24:42,066 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:24:42,074 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 4)) 0)) is different from false [2022-07-20 05:24:42,079 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 4)) 0)) is different from false [2022-07-20 05:24:42,086 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 4)) 0)) is different from false [2022-07-20 05:24:42,091 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 4)) 0)) is different from false [2022-07-20 05:24:42,148 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:42,149 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 26 treesize of output 27 [2022-07-20 05:24:42,154 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:42,154 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 71 treesize of output 71 [2022-07-20 05:24:42,157 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 54 treesize of output 46 [2022-07-20 05:24:42,160 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 24 treesize of output 20 [2022-07-20 05:24:42,722 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:24:42,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247142014] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:42,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:42,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26, 26] total 69 [2022-07-20 05:24:42,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746814218] [2022-07-20 05:24:42,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:42,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-20 05:24:42,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:42,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-20 05:24:42,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2919, Unknown=13, NotChecked=1560, Total=4692 [2022-07-20 05:24:42,724 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 69 states, 69 states have (on average 2.2028985507246377) internal successors, (152), 69 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:43,557 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2022-07-20 05:24:43,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-20 05:24:43,557 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.2028985507246377) internal successors, (152), 69 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2022-07-20 05:24:43,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:43,557 INFO L225 Difference]: With dead ends: 135 [2022-07-20 05:24:43,557 INFO L226 Difference]: Without dead ends: 97 [2022-07-20 05:24:43,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 89 SyntacticMatches, 12 SemanticMatches, 77 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=280, Invalid=4049, Unknown=13, NotChecked=1820, Total=6162 [2022-07-20 05:24:43,558 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1004 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:43,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 953 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 478 Invalid, 0 Unknown, 1004 Unchecked, 0.2s Time] [2022-07-20 05:24:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-20 05:24:43,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2022-07-20 05:24:43,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.065217391304348) internal successors, (98), 93 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-07-20 05:24:43,561 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 64 [2022-07-20 05:24:43,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:43,561 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-07-20 05:24:43,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.2028985507246377) internal successors, (152), 69 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:43,561 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-07-20 05:24:43,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-20 05:24:43,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:43,561 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:43,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:43,761 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,SelfDestructingSolverStorable34 [2022-07-20 05:24:43,762 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:24:43,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:43,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1757527917, now seen corresponding path program 9 times [2022-07-20 05:24:43,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:43,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903984219] [2022-07-20 05:24:43,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:43,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:44,122 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:24:44,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:44,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903984219] [2022-07-20 05:24:44,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903984219] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:44,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273574834] [2022-07-20 05:24:44,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:24:44,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:44,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:44,127 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:24:44,130 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:24:44,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-20 05:24:44,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:44,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-20 05:24:44,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:44,880 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:24:44,881 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:24:45,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:24:45,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:24:45,046 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:24:45,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:24:45,278 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:24:45,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:45,649 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 29 treesize of output 25 [2022-07-20 05:24:45,979 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:24:45,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273574834] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:45,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:45,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 54 [2022-07-20 05:24:45,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002635293] [2022-07-20 05:24:45,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:45,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-20 05:24:45,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:45,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-20 05:24:45,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2664, Unknown=0, NotChecked=0, Total=2970 [2022-07-20 05:24:45,982 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 55 states, 54 states have (on average 3.6296296296296298) internal successors, (196), 55 states have internal predecessors, (196), 0 states have call successors, (0), 0 states 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:24:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:46,721 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-07-20 05:24:46,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 05:24:46,722 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 3.6296296296296298) internal successors, (196), 55 states have internal predecessors, (196), 0 states have call successors, (0), 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 68 [2022-07-20 05:24:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:46,722 INFO L225 Difference]: With dead ends: 94 [2022-07-20 05:24:46,723 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 05:24:46,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=686, Invalid=4284, Unknown=0, NotChecked=0, Total=4970 [2022-07-20 05:24:46,724 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 380 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:46,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 307 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 460 Invalid, 0 Unknown, 75 Unchecked, 0.2s Time] [2022-07-20 05:24:46,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 05:24:46,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-20 05:24:46,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.0543478260869565) internal successors, (97), 93 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:46,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-07-20 05:24:46,727 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 68 [2022-07-20 05:24:46,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:46,729 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-07-20 05:24:46,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 3.6296296296296298) internal successors, (196), 55 states have internal predecessors, (196), 0 states have call successors, (0), 0 states 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:24:46,729 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-07-20 05:24:46,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-20 05:24:46,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:46,730 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:46,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-20 05:24:46,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:46,943 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:24:46,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:46,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1529659500, now seen corresponding path program 10 times [2022-07-20 05:24:46,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:46,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840655043] [2022-07-20 05:24:46,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:46,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:47,761 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:24:47,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:47,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840655043] [2022-07-20 05:24:47,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840655043] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:47,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998818642] [2022-07-20 05:24:47,762 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:24:47,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:47,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:47,763 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:24:47,764 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:24:48,584 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:24:48,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:48,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 126 conjunts are in the unsatisfiable core [2022-07-20 05:24:48,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:48,601 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:24:48,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:24:48,953 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:24:49,016 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 05:24:49,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:49,064 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:24:49,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:49,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 24 treesize of output 12 [2022-07-20 05:24:49,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, 3 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:24:49,425 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:24:49,509 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:24:49,570 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:24:49,628 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:24:49,644 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:24:49,651 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:24:49,654 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:24:49,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:49,663 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|))) is different from false [2022-07-20 05:24:49,667 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:49,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2636 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2636) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:49,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-20 05:24:49,694 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2635 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2635) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-20 05:24:49,699 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-20 05:24:49,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2634 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2634) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-20 05:24:49,721 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:24:49,732 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2633 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2633) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:24:49,739 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-20 05:24:49,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-20 05:24:49,749 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 5 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)) 0)) is different from false [2022-07-20 05:24:49,752 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 5 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)) 0)) is different from false [2022-07-20 05:24:49,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ 5 |c_ULTIMATE.start_cstpncpy_#in~src#1.offset|)) 0)) is different from false [2022-07-20 05:24:49,761 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ 5 |c_ULTIMATE.start_cstpncpy_#in~src#1.offset|)) 0)) is different from false [2022-07-20 05:24:49,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_~#dst#1.base_39| Int)) (or (= (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_39| v_ArrVal_2632) |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_39|) 0)))) is different from false [2022-07-20 05:24:49,771 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:49,772 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 26 treesize of output 27 [2022-07-20 05:24:49,780 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:49,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 135 [2022-07-20 05:24:49,788 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 118 treesize of output 102 [2022-07-20 05:24:49,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2022-07-20 05:24:50,511 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:24:50,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998818642] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:50,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:50,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 29, 29] total 78 [2022-07-20 05:24:50,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724861888] [2022-07-20 05:24:50,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:50,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-07-20 05:24:50,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:50,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-07-20 05:24:50,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3620, Unknown=16, NotChecked=2160, Total=6006 [2022-07-20 05:24:50,513 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 78 states, 78 states have (on average 2.2948717948717947) internal successors, (179), 78 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:24:52,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:52,029 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2022-07-20 05:24:52,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-20 05:24:52,029 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 2.2948717948717947) internal successors, (179), 78 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-07-20 05:24:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:52,030 INFO L225 Difference]: With dead ends: 145 [2022-07-20 05:24:52,030 INFO L226 Difference]: Without dead ends: 101 [2022-07-20 05:24:52,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 104 SyntacticMatches, 11 SemanticMatches, 95 ConstructedPredicates, 16 IntricatePredicates, 1 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=352, Invalid=6171, Unknown=21, NotChecked=2768, Total=9312 [2022-07-20 05:24:52,030 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1218 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:52,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1391 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 824 Invalid, 0 Unknown, 1218 Unchecked, 0.3s Time] [2022-07-20 05:24:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-20 05:24:52,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2022-07-20 05:24:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 97 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2022-07-20 05:24:52,033 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 74 [2022-07-20 05:24:52,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:52,033 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2022-07-20 05:24:52,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 2.2948717948717947) internal successors, (179), 78 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:24:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2022-07-20 05:24:52,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-20 05:24:52,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:52,034 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:52,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-20 05:24:52,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:52,243 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:24:52,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:52,244 INFO L85 PathProgramCache]: Analyzing trace with hash -123927951, now seen corresponding path program 11 times [2022-07-20 05:24:52,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:52,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295859022] [2022-07-20 05:24:52,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:52,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:52,654 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:24:52,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:52,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295859022] [2022-07-20 05:24:52,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295859022] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:52,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686253351] [2022-07-20 05:24:52,654 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:24:52,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:52,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:52,656 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:24:52,666 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:25:01,072 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-07-20 05:25:01,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:25:01,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-20 05:25:01,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:01,111 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:25:01,111 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:25:01,121 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:25:01,121 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:25:01,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:01,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:25:01,409 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:25:01,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:25:01,657 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:25:01,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:02,764 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 66 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:02,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686253351] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:02,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:25:02,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 52 [2022-07-20 05:25:02,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621532631] [2022-07-20 05:25:02,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:02,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-20 05:25:02,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:25:02,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-20 05:25:02,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2468, Unknown=0, NotChecked=0, Total=2756 [2022-07-20 05:25:02,767 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand has 53 states, 52 states have (on average 4.1923076923076925) internal successors, (218), 53 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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:25:03,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:03,728 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2022-07-20 05:25:03,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 05:25:03,728 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 4.1923076923076925) internal successors, (218), 53 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-07-20 05:25:03,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:03,728 INFO L225 Difference]: With dead ends: 98 [2022-07-20 05:25:03,729 INFO L226 Difference]: Without dead ends: 98 [2022-07-20 05:25:03,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=606, Invalid=5094, Unknown=0, NotChecked=0, Total=5700 [2022-07-20 05:25:03,729 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 154 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:03,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 529 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 852 Invalid, 0 Unknown, 51 Unchecked, 0.4s Time] [2022-07-20 05:25:03,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-20 05:25:03,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-20 05:25:03,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 97 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:03,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2022-07-20 05:25:03,732 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 78 [2022-07-20 05:25:03,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:03,732 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2022-07-20 05:25:03,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 4.1923076923076925) internal successors, (218), 53 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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:25:03,733 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2022-07-20 05:25:03,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-20 05:25:03,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:03,733 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:03,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-07-20 05:25:03,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:25:03,947 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:25:03,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:03,948 INFO L85 PathProgramCache]: Analyzing trace with hash 2047124210, now seen corresponding path program 12 times [2022-07-20 05:25:03,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:25:03,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72749982] [2022-07-20 05:25:03,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:03,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:25:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:04,894 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:25:04,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:25:04,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72749982] [2022-07-20 05:25:04,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72749982] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:25:04,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190709658] [2022-07-20 05:25:04,894 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:25:04,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:25:04,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:25:04,895 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:25:04,896 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:25:09,970 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-07-20 05:25:09,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:25:09,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 185 conjunts are in the unsatisfiable core [2022-07-20 05:25:09,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:10,001 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:25:10,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:25:10,479 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:25:10,543 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:25:10,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:25:10,600 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:25:10,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:25:10,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:25:10,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 8 [2022-07-20 05:25:10,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-07-20 05:25:10,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:25:10,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:11,158 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:25:11,310 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:25:11,461 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:25:11,614 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:25:11,763 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:25:11,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:25:11,897 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:11,897 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:25:11,900 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:25:11,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:11,909 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-20 05:25:11,914 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:25:11,926 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3058 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3058) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:25:11,933 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-20 05:25:11,942 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3057 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3057) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)))) is different from false [2022-07-20 05:25:11,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-20 05:25:11,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3056 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3056) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-20 05:25:11,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:25:11,999 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3055 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3055) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:25:12,006 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-20 05:25:12,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3054 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3054) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-20 05:25:12,022 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-20 05:25:12,028 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-20 05:25:12,035 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 6)))) is different from false [2022-07-20 05:25:12,040 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 6)) 0)) is different from false [2022-07-20 05:25:12,047 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 6)) 0)) is different from false [2022-07-20 05:25:12,052 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 6)) 0)) is different from false [2022-07-20 05:25:12,119 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:12,120 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 26 treesize of output 27 [2022-07-20 05:25:12,127 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:12,127 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 71 treesize of output 71 [2022-07-20 05:25:12,131 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 54 treesize of output 46 [2022-07-20 05:25:12,135 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 24 treesize of output 20 [2022-07-20 05:25:12,944 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 113 not checked. [2022-07-20 05:25:12,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190709658] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:12,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:25:12,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 32, 32] total 95 [2022-07-20 05:25:12,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67677971] [2022-07-20 05:25:12,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:12,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-07-20 05:25:12,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:25:12,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-07-20 05:25:12,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=5771, Unknown=17, NotChecked=2856, Total=8930 [2022-07-20 05:25:12,946 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand has 95 states, 95 states have (on average 2.389473684210526) internal successors, (227), 95 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:14,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:14,342 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2022-07-20 05:25:14,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-20 05:25:14,342 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 2.389473684210526) internal successors, (227), 95 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-07-20 05:25:14,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:14,343 INFO L225 Difference]: With dead ends: 152 [2022-07-20 05:25:14,343 INFO L226 Difference]: Without dead ends: 102 [2022-07-20 05:25:14,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 113 ConstructedPredicates, 17 IntricatePredicates, 9 DeprecatedPredicates, 2624 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=430, Invalid=9127, Unknown=17, NotChecked=3536, Total=13110 [2022-07-20 05:25:14,345 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 32 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 2373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1635 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:14,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1558 Invalid, 2373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 732 Invalid, 0 Unknown, 1635 Unchecked, 0.3s Time] [2022-07-20 05:25:14,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-20 05:25:14,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-20 05:25:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.04) internal successors, (104), 101 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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:25:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2022-07-20 05:25:14,347 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 84 [2022-07-20 05:25:14,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:14,347 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2022-07-20 05:25:14,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 2.389473684210526) internal successors, (227), 95 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:14,348 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2022-07-20 05:25:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-20 05:25:14,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:14,348 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:14,385 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:25:14,574 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,SelfDestructingSolverStorable38 [2022-07-20 05:25:14,575 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:25:14,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:14,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1064449423, now seen corresponding path program 13 times [2022-07-20 05:25:14,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:25:14,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600053830] [2022-07-20 05:25:14,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:14,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:25:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 45 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:15,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:25:15,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600053830] [2022-07-20 05:25:15,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600053830] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:25:15,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290298976] [2022-07-20 05:25:15,022 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:25:15,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:25:15,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:25:15,023 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:25:15,024 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:25:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:15,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-20 05:25:15,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:15,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:15,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:25:15,510 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:25:15,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:25:15,707 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 66 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:15,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:16,192 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 27 treesize of output 23 [2022-07-20 05:25:16,627 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:25:16,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:25:16,629 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 55 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:16,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290298976] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:16,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:25:16,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 58 [2022-07-20 05:25:16,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428964674] [2022-07-20 05:25:16,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:16,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-20 05:25:16,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:25:16,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-20 05:25:16,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=3140, Unknown=0, NotChecked=0, Total=3422 [2022-07-20 05:25:16,631 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand has 59 states, 58 states have (on average 3.689655172413793) internal successors, (214), 59 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:17,963 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2022-07-20 05:25:17,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-20 05:25:17,963 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 3.689655172413793) internal successors, (214), 59 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 88 [2022-07-20 05:25:17,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:17,964 INFO L225 Difference]: With dead ends: 102 [2022-07-20 05:25:17,964 INFO L226 Difference]: Without dead ends: 102 [2022-07-20 05:25:17,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1074, Invalid=6236, Unknown=0, NotChecked=0, Total=7310 [2022-07-20 05:25:17,965 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 749 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:17,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 720 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1013 Invalid, 0 Unknown, 99 Unchecked, 0.5s Time] [2022-07-20 05:25:17,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-20 05:25:17,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-20 05:25:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.03) internal successors, (103), 101 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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:25:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2022-07-20 05:25:17,967 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 88 [2022-07-20 05:25:17,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:17,967 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2022-07-20 05:25:17,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 3.689655172413793) internal successors, (214), 59 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2022-07-20 05:25:17,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-20 05:25:17,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:17,968 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:17,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-20 05:25:18,175 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,SelfDestructingSolverStorable39 [2022-07-20 05:25:18,176 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:25:18,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:18,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1646098544, now seen corresponding path program 14 times [2022-07-20 05:25:18,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:25:18,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253809477] [2022-07-20 05:25:18,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:18,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:25:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:19,324 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:25:19,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:25:19,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253809477] [2022-07-20 05:25:19,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253809477] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:25:19,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515952169] [2022-07-20 05:25:19,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:25:19,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:25:19,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:25:19,326 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:25:19,330 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:25:19,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:25:19,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:25:19,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 156 conjunts are in the unsatisfiable core [2022-07-20 05:25:19,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:19,628 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:25:19,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:25:20,125 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:25:20,197 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 05:25:20,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:20,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:25:20,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:25:20,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 24 treesize of output 12 [2022-07-20 05:25:20,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:25:20,676 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:25:20,764 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:25:20,829 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:25:20,895 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:25:20,963 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:25:21,030 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:25:21,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 14 treesize of output 16 [2022-07-20 05:25:21,054 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:25:21,056 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:25:21,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:21,066 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-20 05:25:21,071 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:25:21,086 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3524 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3524) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:25:21,093 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-20 05:25:21,104 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3523 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3523) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-20 05:25:21,111 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-20 05:25:21,122 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3522 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3522) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-20 05:25:21,129 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:25:21,139 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3521) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:25:21,146 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)))) is different from false [2022-07-20 05:25:21,156 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3520 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3520) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-20 05:25:21,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-20 05:25:21,173 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3519 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3519) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-20 05:25:21,179 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-20 05:25:21,186 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-20 05:25:21,192 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 7 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)))) is different from false [2022-07-20 05:25:21,197 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 7 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)) 0)) is different from false [2022-07-20 05:25:21,204 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ 7 |c_ULTIMATE.start_cstpncpy_#in~src#1.offset|)) 0)) is different from false [2022-07-20 05:25:21,208 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ 7 |c_ULTIMATE.start_cstpncpy_#in~src#1.offset|)) 0)) is different from false [2022-07-20 05:25:21,286 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:21,286 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 26 treesize of output 27 [2022-07-20 05:25:21,292 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:21,292 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 71 treesize of output 71 [2022-07-20 05:25:21,295 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 28 treesize of output 24 [2022-07-20 05:25:21,300 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 50 treesize of output 42 [2022-07-20 05:25:22,273 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:25:22,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515952169] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:22,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:25:22,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 35, 35] total 96 [2022-07-20 05:25:22,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158219384] [2022-07-20 05:25:22,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:22,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-07-20 05:25:22,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:25:22,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-07-20 05:25:22,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=5647, Unknown=19, NotChecked=3192, Total=9120 [2022-07-20 05:25:22,275 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand has 96 states, 96 states have (on average 2.4270833333333335) internal successors, (233), 96 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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:25:24,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:24,493 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2022-07-20 05:25:24,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-20 05:25:24,494 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 2.4270833333333335) internal successors, (233), 96 states have internal predecessors, (233), 0 states have call successors, (0), 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 94 [2022-07-20 05:25:24,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:24,494 INFO L225 Difference]: With dead ends: 165 [2022-07-20 05:25:24,494 INFO L226 Difference]: Without dead ends: 109 [2022-07-20 05:25:24,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 135 SyntacticMatches, 15 SemanticMatches, 117 ConstructedPredicates, 19 IntricatePredicates, 1 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=413, Invalid=9544, Unknown=19, NotChecked=4066, Total=14042 [2022-07-20 05:25:24,496 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 2050 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 3404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1877 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:24,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 2091 Invalid, 3404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1509 Invalid, 0 Unknown, 1877 Unchecked, 0.6s Time] [2022-07-20 05:25:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-20 05:25:24,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2022-07-20 05:25:24,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 1.0288461538461537) internal successors, (107), 105 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:25:24,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2022-07-20 05:25:24,498 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 94 [2022-07-20 05:25:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:24,498 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2022-07-20 05:25:24,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 2.4270833333333335) internal successors, (233), 96 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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:25:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2022-07-20 05:25:24,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-20 05:25:24,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:24,500 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:24,527 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:25:24,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:25:24,720 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:25:24,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:24,720 INFO L85 PathProgramCache]: Analyzing trace with hash -45925907, now seen corresponding path program 15 times [2022-07-20 05:25:24,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:25:24,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225867089] [2022-07-20 05:25:24,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:24,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:25:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:25,207 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:25:25,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:25:25,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225867089] [2022-07-20 05:25:25,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225867089] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:25:25,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877186847] [2022-07-20 05:25:25,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:25:25,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:25:25,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:25:25,210 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:25:25,211 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:25:32,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-07-20 05:25:32,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:25:32,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-20 05:25:32,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:32,154 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:25:32,155 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:25:32,168 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:25:32,169 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:25:32,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:25:32,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:25:32,609 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:25:32,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:25:33,060 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:25:33,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 120 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:34,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877186847] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:34,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:25:34,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 69 [2022-07-20 05:25:34,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749954470] [2022-07-20 05:25:34,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:34,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-07-20 05:25:34,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:25:34,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-07-20 05:25:34,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=4329, Unknown=0, NotChecked=0, Total=4830 [2022-07-20 05:25:34,258 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand has 70 states, 69 states have (on average 4.144927536231884) internal successors, (286), 70 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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:25:36,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:36,109 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2022-07-20 05:25:36,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-20 05:25:36,109 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 4.144927536231884) internal successors, (286), 70 states have internal predecessors, (286), 0 states have call successors, (0), 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 98 [2022-07-20 05:25:36,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:36,110 INFO L225 Difference]: With dead ends: 112 [2022-07-20 05:25:36,110 INFO L226 Difference]: Without dead ends: 112 [2022-07-20 05:25:36,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1882, Invalid=8018, Unknown=0, NotChecked=0, Total=9900 [2022-07-20 05:25:36,111 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 731 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:36,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 519 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 782 Invalid, 0 Unknown, 33 Unchecked, 0.4s Time] [2022-07-20 05:25:36,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-20 05:25:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2022-07-20 05:25:36,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 109 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2022-07-20 05:25:36,112 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 98 [2022-07-20 05:25:36,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:36,112 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2022-07-20 05:25:36,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 4.144927536231884) internal successors, (286), 70 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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:25:36,112 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-07-20 05:25:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-20 05:25:36,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:36,113 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:36,123 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:25:36,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:25:36,313 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:25:36,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:36,314 INFO L85 PathProgramCache]: Analyzing trace with hash -14055494, now seen corresponding path program 3 times [2022-07-20 05:25:36,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:25:36,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141234923] [2022-07-20 05:25:36,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:36,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:25:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 103 proven. 97 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-20 05:25:37,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:25:37,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141234923] [2022-07-20 05:25:37,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141234923] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:25:37,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174546347] [2022-07-20 05:25:37,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:25:37,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:25:37,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:25:37,364 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:25:37,365 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:25:46,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-07-20 05:25:46,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:25:46,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 236 conjunts are in the unsatisfiable core [2022-07-20 05:25:46,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:46,244 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:25:46,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:25:46,250 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:25:47,040 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-20 05:25:47,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 33 [2022-07-20 05:25:47,059 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:25:47,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:25:47,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:25:47,127 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 11 treesize of output 7 [2022-07-20 05:25:47,249 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 33 treesize of output 17 [2022-07-20 05:25:47,252 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:25:50,366 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:50,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:59,060 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:59,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174546347] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:59,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:25:59,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 40, 40] total 110 [2022-07-20 05:25:59,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13845234] [2022-07-20 05:25:59,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:59,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2022-07-20 05:25:59,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:25:59,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2022-07-20 05:25:59,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1005, Invalid=11205, Unknown=0, NotChecked=0, Total=12210 [2022-07-20 05:25:59,064 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand has 111 states, 110 states have (on average 2.5090909090909093) internal successors, (276), 111 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:26:14,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:26:14,443 INFO L93 Difference]: Finished difference Result 183 states and 185 transitions. [2022-07-20 05:26:14,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-07-20 05:26:14,443 INFO L78 Accepts]: Start accepts. Automaton has has 111 states, 110 states have (on average 2.5090909090909093) internal successors, (276), 111 states have internal predecessors, (276), 0 states have call successors, (0), 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 104 [2022-07-20 05:26:14,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:26:14,444 INFO L225 Difference]: With dead ends: 183 [2022-07-20 05:26:14,444 INFO L226 Difference]: Without dead ends: 175 [2022-07-20 05:26:14,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10729 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=3115, Invalid=35497, Unknown=0, NotChecked=0, Total=38612 [2022-07-20 05:26:14,446 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 345 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 977 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-20 05:26:14,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1181 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1539 Invalid, 0 Unknown, 977 Unchecked, 1.8s Time] [2022-07-20 05:26:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-20 05:26:14,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 105. [2022-07-20 05:26:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:26:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2022-07-20 05:26:14,449 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 104 [2022-07-20 05:26:14,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:26:14,449 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2022-07-20 05:26:14,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 110 states have (on average 2.5090909090909093) internal successors, (276), 111 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:26:14,450 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2022-07-20 05:26:14,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-20 05:26:14,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:26:14,450 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:26:14,467 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:26:14,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:26:14,663 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:26:14,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:26:14,664 INFO L85 PathProgramCache]: Analyzing trace with hash 6966638, now seen corresponding path program 16 times [2022-07-20 05:26:14,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:26:14,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967843398] [2022-07-20 05:26:14,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:26:14,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:26:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:26:15,881 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:26:15,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:26:15,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967843398] [2022-07-20 05:26:15,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967843398] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:26:15,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404969636] [2022-07-20 05:26:15,881 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:26:15,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:26:15,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:26:15,883 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:26:15,883 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:26:17,201 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:26:17,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:26:17,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 204 conjunts are in the unsatisfiable core [2022-07-20 05:26:17,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:26:17,225 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:26:17,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:26:17,919 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:26:17,987 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:26:17,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:26:18,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:26:18,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:18,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:26:18,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 8 [2022-07-20 05:26:18,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-07-20 05:26:18,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, 2 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:26:18,739 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:26:18,956 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:26:19,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 17 treesize of output 19 [2022-07-20 05:26:19,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:19,639 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:26:19,859 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:26:20,100 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:26:20,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:20,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:26:20,494 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:26:20,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2022-07-20 05:26:20,498 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:26:20,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:26:20,507 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-20 05:26:20,512 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:26:20,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4321 (Array Int Int)) (v_ArrVal_4322 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4321) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:26:20,524 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-20 05:26:20,533 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4320 (Array Int Int)) (v_ArrVal_4322 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4320) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-20 05:26:20,538 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-20 05:26:20,546 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4319 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4319) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-20 05:26:20,552 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)))) is different from false [2022-07-20 05:26:20,559 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4318 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4318) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:26:20,565 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)))) is different from false [2022-07-20 05:26:20,572 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4317 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4317) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-20 05:26:20,577 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-20 05:26:20,584 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4316 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4316) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-20 05:26:20,598 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-20 05:26:20,608 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4315 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4315) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-20 05:26:20,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (not (<= |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-20 05:26:20,730 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (not (<= |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-20 05:26:20,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (< |c_ULTIMATE.start_cstpncpy_~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-20 05:26:20,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (< |c_ULTIMATE.start_cstpncpy_~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-20 05:26:20,777 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (< |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-20 05:26:20,787 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (< |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-20 05:26:20,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:26:20,901 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 26 treesize of output 27 [2022-07-20 05:26:20,908 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:26:20,908 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 71 treesize of output 71 [2022-07-20 05:26:20,913 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 28 treesize of output 24 [2022-07-20 05:26:20,922 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 50 treesize of output 42 [2022-07-20 05:26:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 34 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 198 not checked. [2022-07-20 05:26:22,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404969636] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:26:22,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:26:22,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 39, 39] total 117 [2022-07-20 05:26:22,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971300958] [2022-07-20 05:26:22,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:26:22,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2022-07-20 05:26:22,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:26:22,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2022-07-20 05:26:22,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=8851, Unknown=21, NotChecked=4368, Total=13572 [2022-07-20 05:26:22,536 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 117 states, 117 states have (on average 2.452991452991453) internal successors, (287), 117 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:26:25,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:26:25,523 INFO L93 Difference]: Finished difference Result 174 states and 175 transitions. [2022-07-20 05:26:25,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-20 05:26:25,524 INFO L78 Accepts]: Start accepts. Automaton has has 117 states, 117 states have (on average 2.452991452991453) internal successors, (287), 117 states have internal predecessors, (287), 0 states have call successors, (0), 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 104 [2022-07-20 05:26:25,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:26:25,524 INFO L225 Difference]: With dead ends: 174 [2022-07-20 05:26:25,524 INFO L226 Difference]: Without dead ends: 112 [2022-07-20 05:26:25,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 138 SyntacticMatches, 10 SemanticMatches, 146 ConstructedPredicates, 21 IntricatePredicates, 5 DeprecatedPredicates, 3480 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=539, Invalid=15525, Unknown=22, NotChecked=5670, Total=21756 [2022-07-20 05:26:25,526 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 25 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 2802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1940 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:26:25,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2205 Invalid, 2802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 859 Invalid, 0 Unknown, 1940 Unchecked, 0.3s Time] [2022-07-20 05:26:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-20 05:26:25,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-07-20 05:26:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:26:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2022-07-20 05:26:25,528 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2022-07-20 05:26:25,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:26:25,529 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2022-07-20 05:26:25,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 2.452991452991453) internal successors, (287), 117 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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:26:25,529 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-07-20 05:26:25,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-20 05:26:25,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:26:25,530 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:26:25,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-20 05:26:25,743 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,SelfDestructingSolverStorable43 [2022-07-20 05:26:25,743 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:26:25,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:26:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1020694645, now seen corresponding path program 17 times [2022-07-20 05:26:25,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:26:25,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023855955] [2022-07-20 05:26:25,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:26:25,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:26:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:26:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 91 proven. 296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:26:26,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:26:26,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023855955] [2022-07-20 05:26:26,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023855955] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:26:26,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379629319] [2022-07-20 05:26:26,265 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:26:26,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:26:26,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:26:26,267 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:26:26,270 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:26:37,671 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-20 05:26:37,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:26:37,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 113 conjunts are in the unsatisfiable core [2022-07-20 05:26:37,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:26:37,715 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:26:37,715 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:26:37,724 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:26:37,724 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:26:38,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:26:38,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:26:38,187 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:26:38,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:26:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 120 proven. 267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:26:38,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:26:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 153 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:26:40,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379629319] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:26:40,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:26:40,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 24] total 69 [2022-07-20 05:26:40,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731908321] [2022-07-20 05:26:40,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:26:40,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-07-20 05:26:40,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:26:40,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-07-20 05:26:40,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=518, Invalid=4312, Unknown=0, NotChecked=0, Total=4830 [2022-07-20 05:26:40,240 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand has 70 states, 69 states have (on average 4.3768115942028984) internal successors, (302), 70 states have internal predecessors, (302), 0 states have call successors, (0), 0 states 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:26:41,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:26:41,444 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2022-07-20 05:26:41,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-20 05:26:41,445 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 4.3768115942028984) internal successors, (302), 70 states have internal predecessors, (302), 0 states have call successors, (0), 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 108 [2022-07-20 05:26:41,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:26:41,446 INFO L225 Difference]: With dead ends: 117 [2022-07-20 05:26:41,446 INFO L226 Difference]: Without dead ends: 117 [2022-07-20 05:26:41,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1928 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1496, Invalid=7246, Unknown=0, NotChecked=0, Total=8742 [2022-07-20 05:26:41,447 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 633 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:26:41,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 863 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1331 Invalid, 0 Unknown, 77 Unchecked, 0.5s Time] [2022-07-20 05:26:41,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-20 05:26:41,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2022-07-20 05:26:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:26:41,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2022-07-20 05:26:41,459 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 108 [2022-07-20 05:26:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:26:41,460 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2022-07-20 05:26:41,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 4.3768115942028984) internal successors, (302), 70 states have internal predecessors, (302), 0 states have call successors, (0), 0 states 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:26:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2022-07-20 05:26:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-20 05:26:41,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:26:41,461 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:26:41,477 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:26:41,676 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,SelfDestructingSolverStorable44 [2022-07-20 05:26:41,676 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:26:41,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:26:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1842522996, now seen corresponding path program 18 times [2022-07-20 05:26:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:26:41,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384710529] [2022-07-20 05:26:41,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:26:41,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:26:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:26:43,125 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:26:43,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:26:43,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384710529] [2022-07-20 05:26:43,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384710529] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:26:43,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898849608] [2022-07-20 05:26:43,125 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:26:43,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:26:43,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:26:43,128 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:26:43,132 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:27:13,299 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-07-20 05:27:13,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:27:13,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 194 conjunts are in the unsatisfiable core [2022-07-20 05:27:13,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:27:13,338 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:27:13,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:27:14,024 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:14,103 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 05:27:14,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:27:14,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:27:14,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:27:14,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 24 treesize of output 12 [2022-07-20 05:27:14,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:14,635 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:14,732 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:27:14,806 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:27:14,877 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:27:14,950 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:27:15,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:27:15,097 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:27:15,172 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:27:15,244 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:27:15,389 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:27:15,392 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:27:15,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:27:15,404 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-20 05:27:15,410 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:27:15,419 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4888 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4888) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:27:15,425 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-20 05:27:15,434 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4887 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4887) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-20 05:27:15,441 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-20 05:27:15,450 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4886 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4886) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-20 05:27:15,456 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:27:15,465 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4885 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4885) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:27:15,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-20 05:27:15,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4884 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4884) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-20 05:27:15,487 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-20 05:27:15,496 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4883 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4883) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-20 05:27:15,502 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)))) is different from false [2022-07-20 05:27:15,511 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4882 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4882) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-20 05:27:15,518 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 8)))) is different from false [2022-07-20 05:27:15,527 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4881 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4881) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 8)))) is different from false [2022-07-20 05:27:15,534 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4889 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 9)) 0)) is different from false [2022-07-20 05:27:15,539 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4880) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 9)) 0)) is different from false [2022-07-20 05:27:15,546 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4880) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 9 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)) 0)) is different from false [2022-07-20 05:27:15,550 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4880) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 9 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)) 0)) is different from false [2022-07-20 05:27:15,557 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4880) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 9)) 0)) is different from false [2022-07-20 05:27:15,562 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4880 (Array Int Int)) (v_ArrVal_4889 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4880) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_4889) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 9)) 0)) is different from false [2022-07-20 05:27:15,657 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:27:15,657 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 26 treesize of output 27 [2022-07-20 05:27:15,668 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:27:15,668 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 141 treesize of output 135 [2022-07-20 05:27:15,674 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 118 treesize of output 110 [2022-07-20 05:27:15,677 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 110 treesize of output 94 [2022-07-20 05:27:16,983 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:27:16,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898849608] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:27:16,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:27:16,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 41, 41] total 117 [2022-07-20 05:27:16,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909244900] [2022-07-20 05:27:16,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:27:16,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2022-07-20 05:27:16,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:16,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2022-07-20 05:27:16,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=8488, Unknown=23, NotChecked=4738, Total=13572 [2022-07-20 05:27:16,986 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 117 states, 117 states have (on average 2.5042735042735043) internal successors, (293), 117 states have internal predecessors, (293), 0 states have call successors, (0), 0 states 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:19,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:19,971 INFO L93 Difference]: Finished difference Result 190 states and 191 transitions. [2022-07-20 05:27:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-20 05:27:19,971 INFO L78 Accepts]: Start accepts. Automaton has has 117 states, 117 states have (on average 2.5042735042735043) internal successors, (293), 117 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-07-20 05:27:19,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:19,972 INFO L225 Difference]: With dead ends: 190 [2022-07-20 05:27:19,972 INFO L226 Difference]: Without dead ends: 122 [2022-07-20 05:27:19,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 162 SyntacticMatches, 16 SemanticMatches, 143 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 2865 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=496, Invalid=14335, Unknown=23, NotChecked=6026, Total=20880 [2022-07-20 05:27:19,973 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 45 mSDsluCounter, 2510 mSDsCounter, 0 mSdLazyCounter, 2251 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 6040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3754 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:19,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2554 Invalid, 6040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2251 Invalid, 0 Unknown, 3754 Unchecked, 0.8s Time] [2022-07-20 05:27:19,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-20 05:27:19,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2022-07-20 05:27:19,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 0 states have call successors, (0), 0 states 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:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2022-07-20 05:27:19,975 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2022-07-20 05:27:19,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:19,976 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2022-07-20 05:27:19,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 2.5042735042735043) internal successors, (293), 117 states have internal predecessors, (293), 0 states have call successors, (0), 0 states 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:19,976 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-07-20 05:27:19,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-20 05:27:19,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:19,985 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:20,003 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:27:20,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-07-20 05:27:20,187 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:27:20,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:20,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1876047465, now seen corresponding path program 19 times [2022-07-20 05:27:20,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:20,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017335456] [2022-07-20 05:27:20,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:20,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:20,821 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:27:20,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:20,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017335456] [2022-07-20 05:27:20,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017335456] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:27:20,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079126766] [2022-07-20 05:27:20,822 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:27:20,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:20,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:27:20,824 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:27:20,826 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:27:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:21,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 830 conjuncts, 113 conjunts are in the unsatisfiable core [2022-07-20 05:27:21,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:27:21,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:27:21,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:27:21,681 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:27:21,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:27:21,939 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:27:21,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:27:22,630 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 27 treesize of output 23 [2022-07-20 05:27:23,318 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:27:23,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:27:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 136 proven. 344 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:23,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079126766] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:27:23,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:27:23,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 73 [2022-07-20 05:27:23,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719324578] [2022-07-20 05:27:23,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:27:23,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-07-20 05:27:23,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:23,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-07-20 05:27:23,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=4955, Unknown=0, NotChecked=0, Total=5402 [2022-07-20 05:27:23,323 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 74 states, 73 states have (on average 3.9178082191780823) internal successors, (286), 74 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:25,194 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2022-07-20 05:27:25,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-20 05:27:25,195 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 3.9178082191780823) internal successors, (286), 74 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-07-20 05:27:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:25,195 INFO L225 Difference]: With dead ends: 127 [2022-07-20 05:27:25,196 INFO L226 Difference]: Without dead ends: 127 [2022-07-20 05:27:25,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1897 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2186, Invalid=9586, Unknown=0, NotChecked=0, Total=11772 [2022-07-20 05:27:25,197 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 562 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:25,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 958 Invalid, 1839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1594 Invalid, 0 Unknown, 141 Unchecked, 0.6s Time] [2022-07-20 05:27:25,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-20 05:27:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-07-20 05:27:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.0161290322580645) internal successors, (126), 124 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2022-07-20 05:27:25,198 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 118 [2022-07-20 05:27:25,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:25,198 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2022-07-20 05:27:25,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 3.9178082191780823) internal successors, (286), 74 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2022-07-20 05:27:25,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-20 05:27:25,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:25,199 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:25,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-07-20 05:27:25,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:25,415 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:27:25,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:25,416 INFO L85 PathProgramCache]: Analyzing trace with hash 307297514, now seen corresponding path program 20 times [2022-07-20 05:27:25,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:25,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995263259] [2022-07-20 05:27:25,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:25,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:27,124 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:27:27,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:27,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995263259] [2022-07-20 05:27:27,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995263259] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:27:27,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150389296] [2022-07-20 05:27:27,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:27:27,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:27,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:27:27,126 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:27:27,126 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:27:27,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:27:27,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:27:27,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 201 conjunts are in the unsatisfiable core [2022-07-20 05:27:27,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:27:27,507 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:27:27,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:27:28,280 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:28,356 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 05:27:28,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:27:28,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:27:28,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:27:28,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 24 treesize of output 12 [2022-07-20 05:27:28,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:28,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:27:29,025 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:27:29,098 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:27:29,172 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:27:29,247 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:27:29,324 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:27:29,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:27:29,476 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:27:29,555 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:27:29,571 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:27:29,578 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:27:29,581 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:27:29,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:27:29,590 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|))) is different from false [2022-07-20 05:27:29,595 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:27:29,602 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5500 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5500) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:27:29,607 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-20 05:27:29,615 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5499 (Array Int Int)) (v_ArrVal_5501 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5499) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-20 05:27:29,620 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-20 05:27:29,627 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5498 (Array Int Int)) (v_ArrVal_5501 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5498) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-20 05:27:29,632 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:27:29,639 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5497 (Array Int Int)) (v_ArrVal_5501 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5497) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:27:29,649 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-20 05:27:29,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5496 (Array Int Int)) (v_ArrVal_5501 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5496) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-20 05:27:29,667 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-20 05:27:29,678 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5495 (Array Int Int)) (v_ArrVal_5501 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5495) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-20 05:27:29,685 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-20 05:27:29,696 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5494 (Array Int Int)) (v_ArrVal_5501 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5494) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-20 05:27:29,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-20 05:27:29,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5493 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5493) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-20 05:27:29,721 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 9)) 0)) is different from false [2022-07-20 05:27:29,732 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5492 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_5492) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 9)) 0)) is different from false [2022-07-20 05:27:29,738 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-20 05:27:29,758 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_5491) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-20 05:27:29,764 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_5491) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 10)) 0)) is different from false [2022-07-20 05:27:29,768 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_5491) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 10)) 0)) is different from false [2022-07-20 05:27:29,774 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_5491) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 10)) 0)) is different from false [2022-07-20 05:27:29,778 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5501 (Array Int Int)) (v_ArrVal_5491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_5491) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_5501) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 10)) 0)) is different from false [2022-07-20 05:27:29,863 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:27:29,863 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 26 treesize of output 27 [2022-07-20 05:27:29,876 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:27:29,876 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 71 treesize of output 71 [2022-07-20 05:27:29,880 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 54 treesize of output 46 [2022-07-20 05:27:29,884 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 24 treesize of output 20 [2022-07-20 05:27:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 42 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 309 not checked. [2022-07-20 05:27:31,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150389296] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:27:31,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:27:31,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 44, 44] total 123 [2022-07-20 05:27:31,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657070835] [2022-07-20 05:27:31,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:27:31,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 123 states [2022-07-20 05:27:31,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:31,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2022-07-20 05:27:31,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=9244, Unknown=25, NotChecked=5400, Total=15006 [2022-07-20 05:27:31,413 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand has 123 states, 123 states have (on average 2.5528455284552845) internal successors, (314), 123 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:34,634 INFO L93 Difference]: Finished difference Result 206 states and 207 transitions. [2022-07-20 05:27:34,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-20 05:27:34,635 INFO L78 Accepts]: Start accepts. Automaton has has 123 states, 123 states have (on average 2.5528455284552845) internal successors, (314), 123 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2022-07-20 05:27:34,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:34,635 INFO L225 Difference]: With dead ends: 206 [2022-07-20 05:27:34,635 INFO L226 Difference]: Without dead ends: 132 [2022-07-20 05:27:34,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 179 SyntacticMatches, 22 SemanticMatches, 149 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 3181 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=509, Invalid=15316, Unknown=25, NotChecked=6800, Total=22650 [2022-07-20 05:27:34,636 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 29 mSDsluCounter, 2852 mSDsCounter, 0 mSdLazyCounter, 2033 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2900 SdHoareTripleChecker+Invalid, 4965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2915 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:34,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2900 Invalid, 4965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2033 Invalid, 0 Unknown, 2915 Unchecked, 0.7s Time] [2022-07-20 05:27:34,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-20 05:27:34,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2022-07-20 05:27:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.015625) internal successors, (130), 128 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:27:34,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2022-07-20 05:27:34,640 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2022-07-20 05:27:34,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:34,640 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2022-07-20 05:27:34,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 123 states, 123 states have (on average 2.5528455284552845) internal successors, (314), 123 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2022-07-20 05:27:34,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-20 05:27:34,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:34,642 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:34,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-20 05:27:34,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-07-20 05:27:34,855 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-20 05:27:34,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:34,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1115754873, now seen corresponding path program 21 times [2022-07-20 05:27:34,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:34,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427898524] [2022-07-20 05:27:34,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:34,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:35,557 INFO L134 CoverageAnalysis]: Checked inductivity of 583 backedges. 153 proven. 430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:35,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:35,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427898524] [2022-07-20 05:27:35,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427898524] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:27:35,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163895459] [2022-07-20 05:27:35,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:27:35,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:35,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:27:35,559 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:27:35,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process