./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:17:46,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:17:46,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:17:46,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:17:46,586 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:17:46,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:17:46,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:17:46,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:17:46,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:17:46,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:17:46,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:17:46,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:17:46,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:17:46,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:17:46,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:17:46,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:17:46,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:17:46,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:17:46,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:17:46,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:17:46,609 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:17:46,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:17:46,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:17:46,611 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:17:46,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:17:46,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:17:46,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:17:46,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:17:46,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:17:46,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:17:46,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:17:46,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:17:46,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:17:46,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:17:46,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:17:46,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:17:46,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:17:46,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:17:46,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:17:46,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:17:46,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:17:46,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:17:46,620 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:17:46,640 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:17:46,641 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:17:46,641 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:17:46,641 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:17:46,643 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:17:46,643 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:17:46,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:17:46,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:17:46,644 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:17:46,645 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:17:46,645 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:17:46,645 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:17:46,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:17:46,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:17:46,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:17:46,646 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:17:46,646 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:17:46,646 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:17:46,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:17:46,646 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:17:46,646 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:17:46,646 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:17:46,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:17:46,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:17:46,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:17:46,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:17:46,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:17:46,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:17:46,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:17:46,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:17:46,648 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fa78fde783b634840a8dd117d9f71a3fa4064d7e1622444edf74e6b44f549a34 [2022-07-12 18:17:46,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:17:46,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:17:46,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:17:46,856 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:17:46,856 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:17:46,857 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2022-07-12 18:17:46,923 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/981341ca0/9724f1c09d65445b98ab80da45d9cf7d/FLAGfd06b10a9 [2022-07-12 18:17:47,309 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:17:47,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcpy-alloca-1.i [2022-07-12 18:17:47,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/981341ca0/9724f1c09d65445b98ab80da45d9cf7d/FLAGfd06b10a9 [2022-07-12 18:17:47,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/981341ca0/9724f1c09d65445b98ab80da45d9cf7d [2022-07-12 18:17:47,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:17:47,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:17:47,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:17:47,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:17:47,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:17:47,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:17:47" (1/1) ... [2022-07-12 18:17:47,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71ffd718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:47, skipping insertion in model container [2022-07-12 18:17:47,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:17:47" (1/1) ... [2022-07-12 18:17:47,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:17:47,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:17:47,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:17:47,969 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:17:48,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:17:48,036 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:17:48,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:48 WrapperNode [2022-07-12 18:17:48,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:17:48,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:17:48,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:17:48,038 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:17:48,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:48" (1/1) ... [2022-07-12 18:17:48,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:48" (1/1) ... [2022-07-12 18:17:48,064 INFO L137 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2022-07-12 18:17:48,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:17:48,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:17:48,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:17:48,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:17:48,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:48" (1/1) ... [2022-07-12 18:17:48,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:48" (1/1) ... [2022-07-12 18:17:48,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:48" (1/1) ... [2022-07-12 18:17:48,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:48" (1/1) ... [2022-07-12 18:17:48,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:48" (1/1) ... [2022-07-12 18:17:48,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:48" (1/1) ... [2022-07-12 18:17:48,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:48" (1/1) ... [2022-07-12 18:17:48,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:17:48,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:17:48,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:17:48,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:17:48,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:48" (1/1) ... [2022-07-12 18:17:48,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:17:48,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:17:48,112 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-12 18:17:48,116 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-12 18:17:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 18:17:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 18:17:48,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 18:17:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:17:48,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:17:48,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:17:48,201 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:17:48,203 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:17:48,336 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:17:48,340 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:17:48,341 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 18:17:48,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:17:48 BoogieIcfgContainer [2022-07-12 18:17:48,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:17:48,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:17:48,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:17:48,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:17:48,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:17:47" (1/3) ... [2022-07-12 18:17:48,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b21762f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:17:48, skipping insertion in model container [2022-07-12 18:17:48,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:48" (2/3) ... [2022-07-12 18:17:48,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b21762f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:17:48, skipping insertion in model container [2022-07-12 18:17:48,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:17:48" (3/3) ... [2022-07-12 18:17:48,356 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca-1.i [2022-07-12 18:17:48,366 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:17:48,366 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-07-12 18:17:48,397 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:17:48,415 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@6e0e3e50, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1a3191f0 [2022-07-12 18:17:48,416 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-07-12 18:17:48,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:17:48,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:48,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:17:48,451 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:48,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:48,458 INFO L85 PathProgramCache]: Analyzing trace with hash 889510840, now seen corresponding path program 1 times [2022-07-12 18:17:48,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:48,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185879986] [2022-07-12 18:17:48,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:48,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:48,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:48,608 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-12 18:17:48,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:48,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185879986] [2022-07-12 18:17:48,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185879986] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:17:48,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:17:48,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:17:48,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981249199] [2022-07-12 18:17:48,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:17:48,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:17:48,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:48,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:17:48,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:17:48,642 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:48,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:48,696 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-07-12 18:17:48,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:17:48,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 18:17:48,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:48,705 INFO L225 Difference]: With dead ends: 34 [2022-07-12 18:17:48,706 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 18:17:48,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:17:48,711 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 56 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:48,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 35 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:17:48,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 18:17:48,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-07-12 18:17:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:48,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-12 18:17:48,740 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2022-07-12 18:17:48,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:48,741 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-12 18:17:48,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-12 18:17:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:17:48,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:48,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:17:48,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:17:48,743 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:48,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:48,745 INFO L85 PathProgramCache]: Analyzing trace with hash 889512762, now seen corresponding path program 1 times [2022-07-12 18:17:48,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:48,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695461260] [2022-07-12 18:17:48,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:48,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:48,785 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-12 18:17:48,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:48,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695461260] [2022-07-12 18:17:48,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695461260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:17:48,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:17:48,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:17:48,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2615384] [2022-07-12 18:17:48,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:17:48,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:17:48,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:48,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:17:48,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:17:48,790 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:48,812 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-07-12 18:17:48,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:17:48,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 18:17:48,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:48,815 INFO L225 Difference]: With dead ends: 29 [2022-07-12 18:17:48,815 INFO L226 Difference]: Without dead ends: 28 [2022-07-12 18:17:48,818 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-12 18:17:48,820 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:48,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:17:48,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-12 18:17:48,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-12 18:17:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-12 18:17:48,826 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2022-07-12 18:17:48,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:48,827 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-12 18:17:48,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:48,827 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-12 18:17:48,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:17:48,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:48,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:48,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:17:48,828 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:48,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:48,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033015, now seen corresponding path program 1 times [2022-07-12 18:17:48,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:48,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271271309] [2022-07-12 18:17:48,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:48,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:48,869 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-12 18:17:48,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:48,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271271309] [2022-07-12 18:17:48,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271271309] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:17:48,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:17:48,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:17:48,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651411908] [2022-07-12 18:17:48,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:17:48,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:17:48,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:48,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:17:48,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:17:48,871 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:48,893 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-07-12 18:17:48,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:17:48,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-12 18:17:48,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:48,894 INFO L225 Difference]: With dead ends: 25 [2022-07-12 18:17:48,894 INFO L226 Difference]: Without dead ends: 25 [2022-07-12 18:17:48,895 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-12 18:17:48,901 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:48,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:17:48,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-12 18:17:48,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-12 18:17:48,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-07-12 18:17:48,907 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2022-07-12 18:17:48,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:48,907 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-07-12 18:17:48,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-07-12 18:17:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:17:48,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:48,909 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:48,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:17:48,909 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:48,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:48,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033016, now seen corresponding path program 1 times [2022-07-12 18:17:48,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:48,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192826018] [2022-07-12 18:17:48,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:48,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:48,956 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-12 18:17:48,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:48,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192826018] [2022-07-12 18:17:48,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192826018] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:17:48,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:17:48,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:17:48,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359414289] [2022-07-12 18:17:48,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:17:48,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:17:48,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:48,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:17:48,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:17:48,959 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:48,979 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-07-12 18:17:48,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:17:48,979 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-12 18:17:48,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:48,981 INFO L225 Difference]: With dead ends: 24 [2022-07-12 18:17:48,981 INFO L226 Difference]: Without dead ends: 24 [2022-07-12 18:17:48,981 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-12 18:17:48,983 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:48,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:17:48,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-12 18:17:48,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-12 18:17:48,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-12 18:17:48,987 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2022-07-12 18:17:48,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:48,987 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-12 18:17:48,987 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-12 18:17:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-12 18:17:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:17:48,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:48,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:48,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:17:48,989 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:48,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033069, now seen corresponding path program 1 times [2022-07-12 18:17:48,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:48,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887307935] [2022-07-12 18:17:48,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:48,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:49,043 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-12 18:17:49,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:49,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887307935] [2022-07-12 18:17:49,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887307935] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:17:49,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:17:49,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:17:49,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177642783] [2022-07-12 18:17:49,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:17:49,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:17:49,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:49,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:17:49,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:17:49,056 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:49,067 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-07-12 18:17:49,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:17:49,068 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-12 18:17:49,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:49,068 INFO L225 Difference]: With dead ends: 40 [2022-07-12 18:17:49,068 INFO L226 Difference]: Without dead ends: 40 [2022-07-12 18:17:49,069 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-12 18:17:49,069 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:49,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:17:49,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-12 18:17:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2022-07-12 18:17:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.45) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-12 18:17:49,072 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 7 [2022-07-12 18:17:49,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:49,073 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-12 18:17:49,073 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-12 18:17:49,073 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-12 18:17:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:17:49,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:49,073 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:49,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:17:49,074 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:49,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:49,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1805092651, now seen corresponding path program 1 times [2022-07-12 18:17:49,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:49,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549973997] [2022-07-12 18:17:49,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:49,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:49,115 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-12 18:17:49,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:49,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549973997] [2022-07-12 18:17:49,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549973997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:17:49,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:17:49,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:17:49,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806278309] [2022-07-12 18:17:49,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:17:49,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:17:49,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:49,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:17:49,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:17:49,119 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:49,171 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-07-12 18:17:49,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:17:49,172 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-12 18:17:49,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:49,174 INFO L225 Difference]: With dead ends: 44 [2022-07-12 18:17:49,174 INFO L226 Difference]: Without dead ends: 44 [2022-07-12 18:17:49,175 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-12 18:17:49,175 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 56 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:49,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 33 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:17:49,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-12 18:17:49,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2022-07-12 18:17:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-12 18:17:49,183 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 7 [2022-07-12 18:17:49,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:49,183 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-12 18:17:49,183 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-12 18:17:49,183 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-12 18:17:49,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:17:49,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:49,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:49,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:17:49,185 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:49,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:49,185 INFO L85 PathProgramCache]: Analyzing trace with hash 748014037, now seen corresponding path program 1 times [2022-07-12 18:17:49,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:49,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445538307] [2022-07-12 18:17:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:49,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:49,252 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-12 18:17:49,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:49,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445538307] [2022-07-12 18:17:49,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445538307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:17:49,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:17:49,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:17:49,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961536517] [2022-07-12 18:17:49,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:17:49,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:17:49,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:49,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:17:49,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:17:49,254 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:49,322 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-07-12 18:17:49,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:17:49,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 18:17:49,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:49,325 INFO L225 Difference]: With dead ends: 35 [2022-07-12 18:17:49,325 INFO L226 Difference]: Without dead ends: 35 [2022-07-12 18:17:49,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:17:49,326 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 85 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:49,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 48 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:17:49,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-12 18:17:49,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2022-07-12 18:17:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-12 18:17:49,328 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2022-07-12 18:17:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:49,328 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-12 18:17:49,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-12 18:17:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:17:49,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:49,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:49,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:17:49,329 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:49,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash 748014036, now seen corresponding path program 1 times [2022-07-12 18:17:49,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:49,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605925105] [2022-07-12 18:17:49,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:49,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:49,359 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-12 18:17:49,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:49,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605925105] [2022-07-12 18:17:49,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605925105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:17:49,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:17:49,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:17:49,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884032163] [2022-07-12 18:17:49,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:17:49,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:17:49,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:49,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:17:49,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:17:49,361 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:49,391 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-07-12 18:17:49,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:17:49,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 18:17:49,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:49,392 INFO L225 Difference]: With dead ends: 29 [2022-07-12 18:17:49,392 INFO L226 Difference]: Without dead ends: 29 [2022-07-12 18:17:49,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:17:49,393 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:49,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 37 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:17:49,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-12 18:17:49,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-07-12 18:17:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-07-12 18:17:49,412 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 10 [2022-07-12 18:17:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:49,412 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-07-12 18:17:49,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-07-12 18:17:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:17:49,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:49,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:49,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:17:49,413 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:49,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:49,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1713598655, now seen corresponding path program 1 times [2022-07-12 18:17:49,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:49,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495912105] [2022-07-12 18:17:49,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:49,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:49,463 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-12 18:17:49,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:49,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495912105] [2022-07-12 18:17:49,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495912105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:17:49,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:17:49,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:17:49,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559391166] [2022-07-12 18:17:49,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:17:49,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:17:49,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:49,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:17:49,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:17:49,466 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:49,494 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-07-12 18:17:49,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:17:49,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 18:17:49,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:49,495 INFO L225 Difference]: With dead ends: 28 [2022-07-12 18:17:49,495 INFO L226 Difference]: Without dead ends: 28 [2022-07-12 18:17:49,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:17:49,496 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:49,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 44 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:17:49,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-12 18:17:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-12 18:17:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-12 18:17:49,498 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 11 [2022-07-12 18:17:49,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:49,498 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-12 18:17:49,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-12 18:17:49,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:17:49,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:49,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:49,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 18:17:49,499 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:49,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:49,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1713598656, now seen corresponding path program 1 times [2022-07-12 18:17:49,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:49,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959542280] [2022-07-12 18:17:49,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:49,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:49,544 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-12 18:17:49,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:49,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959542280] [2022-07-12 18:17:49,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959542280] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:17:49,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:17:49,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:17:49,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094956315] [2022-07-12 18:17:49,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:17:49,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:17:49,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:49,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:17:49,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:17:49,546 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:49,588 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-07-12 18:17:49,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:17:49,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 18:17:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:49,588 INFO L225 Difference]: With dead ends: 30 [2022-07-12 18:17:49,589 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 18:17:49,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:17:49,589 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 45 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:49,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:17:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 18:17:49,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-07-12 18:17:49,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.32) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-07-12 18:17:49,591 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 11 [2022-07-12 18:17:49,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:49,592 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-07-12 18:17:49,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-07-12 18:17:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:17:49,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:49,592 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:49,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 18:17:49,593 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:49,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash 952918382, now seen corresponding path program 1 times [2022-07-12 18:17:49,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:49,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284954084] [2022-07-12 18:17:49,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:17:49,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:49,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284954084] [2022-07-12 18:17:49,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284954084] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:17:49,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:17:49,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:17:49,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364057591] [2022-07-12 18:17:49,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:17:49,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:17:49,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:49,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:17:49,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:17:49,617 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:49,633 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-07-12 18:17:49,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:17:49,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 18:17:49,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:49,634 INFO L225 Difference]: With dead ends: 49 [2022-07-12 18:17:49,634 INFO L226 Difference]: Without dead ends: 49 [2022-07-12 18:17:49,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:17:49,635 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:49,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:17:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-12 18:17:49,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2022-07-12 18:17:49,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-12 18:17:49,637 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 11 [2022-07-12 18:17:49,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:49,637 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-12 18:17:49,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-12 18:17:49,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:17:49,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:49,638 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:49,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 18:17:49,638 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:49,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:49,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1632976752, now seen corresponding path program 1 times [2022-07-12 18:17:49,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:49,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452503105] [2022-07-12 18:17:49,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:49,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:49,689 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-12 18:17:49,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:49,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452503105] [2022-07-12 18:17:49,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452503105] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:17:49,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170043926] [2022-07-12 18:17:49,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:49,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:17:49,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:17:49,692 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-12 18:17:49,697 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-12 18:17:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:49,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:17:49,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:17:49,847 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:17:49,848 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-12 18:17:49,902 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-12 18:17:49,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:17:50,036 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-12 18:17:50,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170043926] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:17:50,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:17:50,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-12 18:17:50,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813236788] [2022-07-12 18:17:50,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:17:50,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:17:50,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:50,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:17:50,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:17:50,039 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:50,155 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2022-07-12 18:17:50,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:17:50,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 18:17:50,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:50,157 INFO L225 Difference]: With dead ends: 62 [2022-07-12 18:17:50,157 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 18:17:50,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:17:50,157 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 84 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:50,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 91 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:17:50,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 18:17:50,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 27. [2022-07-12 18:17:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-12 18:17:50,162 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 11 [2022-07-12 18:17:50,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:50,162 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-12 18:17:50,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:50,162 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-12 18:17:50,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:17:50,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:50,163 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:50,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 18:17:50,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 18:17:50,377 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:50,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:50,377 INFO L85 PathProgramCache]: Analyzing trace with hash -163723683, now seen corresponding path program 1 times [2022-07-12 18:17:50,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:50,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882011578] [2022-07-12 18:17:50,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:50,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:50,447 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-12 18:17:50,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:50,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882011578] [2022-07-12 18:17:50,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882011578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:17:50,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:17:50,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:17:50,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919651031] [2022-07-12 18:17:50,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:17:50,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:17:50,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:50,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:17:50,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:17:50,449 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:50,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:50,513 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-07-12 18:17:50,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:17:50,513 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 18:17:50,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:50,514 INFO L225 Difference]: With dead ends: 39 [2022-07-12 18:17:50,514 INFO L226 Difference]: Without dead ends: 39 [2022-07-12 18:17:50,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:17:50,515 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:50,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 92 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:17:50,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-12 18:17:50,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-07-12 18:17:50,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-07-12 18:17:50,517 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2022-07-12 18:17:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:50,517 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-07-12 18:17:50,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-07-12 18:17:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:17:50,518 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:50,518 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:50,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 18:17:50,519 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:50,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:50,519 INFO L85 PathProgramCache]: Analyzing trace with hash 537340895, now seen corresponding path program 1 times [2022-07-12 18:17:50,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:50,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223010282] [2022-07-12 18:17:50,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:50,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:50,576 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-12 18:17:50,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:50,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223010282] [2022-07-12 18:17:50,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223010282] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:17:50,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:17:50,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:17:50,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574550774] [2022-07-12 18:17:50,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:17:50,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:17:50,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:50,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:17:50,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:17:50,578 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:50,647 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-07-12 18:17:50,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:17:50,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 18:17:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:50,648 INFO L225 Difference]: With dead ends: 53 [2022-07-12 18:17:50,648 INFO L226 Difference]: Without dead ends: 53 [2022-07-12 18:17:50,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:17:50,649 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 21 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:50,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 110 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:17:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-12 18:17:50,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2022-07-12 18:17:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:50,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-12 18:17:50,651 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2022-07-12 18:17:50,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:50,651 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-12 18:17:50,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-12 18:17:50,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:17:50,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:50,652 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:50,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 18:17:50,652 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:50,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:50,653 INFO L85 PathProgramCache]: Analyzing trace with hash 795506333, now seen corresponding path program 1 times [2022-07-12 18:17:50,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:50,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97810513] [2022-07-12 18:17:50,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:50,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:50,731 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-12 18:17:50,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:50,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97810513] [2022-07-12 18:17:50,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97810513] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:17:50,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:17:50,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:17:50,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24116480] [2022-07-12 18:17:50,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:17:50,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:17:50,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:50,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:17:50,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:17:50,733 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:50,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:50,917 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-07-12 18:17:50,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:17:50,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 18:17:50,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:50,919 INFO L225 Difference]: With dead ends: 47 [2022-07-12 18:17:50,919 INFO L226 Difference]: Without dead ends: 47 [2022-07-12 18:17:50,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:17:50,921 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:50,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 95 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:17:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-12 18:17:50,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2022-07-12 18:17:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-07-12 18:17:50,924 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 14 [2022-07-12 18:17:50,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:50,925 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-07-12 18:17:50,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:50,925 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-07-12 18:17:50,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 18:17:50,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:50,927 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:50,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 18:17:50,927 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:50,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:50,928 INFO L85 PathProgramCache]: Analyzing trace with hash -780511546, now seen corresponding path program 1 times [2022-07-12 18:17:50,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:50,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724003672] [2022-07-12 18:17:50,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:50,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:50,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:17:50,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:50,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724003672] [2022-07-12 18:17:50,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724003672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:17:50,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:17:50,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:17:50,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717044890] [2022-07-12 18:17:50,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:17:50,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:17:50,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:50,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:17:50,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:17:50,996 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:51,004 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-07-12 18:17:51,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:17:51,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 18:17:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:51,005 INFO L225 Difference]: With dead ends: 33 [2022-07-12 18:17:51,005 INFO L226 Difference]: Without dead ends: 21 [2022-07-12 18:17:51,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:17:51,006 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:51,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:17:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-12 18:17:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-12 18:17:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-07-12 18:17:51,009 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2022-07-12 18:17:51,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:51,009 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-07-12 18:17:51,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-07-12 18:17:51,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:17:51,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:51,010 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:51,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 18:17:51,010 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:51,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:51,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2086958086, now seen corresponding path program 1 times [2022-07-12 18:17:51,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:51,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102125870] [2022-07-12 18:17:51,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:51,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:51,121 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-12 18:17:51,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:51,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102125870] [2022-07-12 18:17:51,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102125870] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:17:51,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673330294] [2022-07-12 18:17:51,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:51,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:17:51,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:17:51,136 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-12 18:17:51,155 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-12 18:17:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:51,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 18:17:51,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:17:51,273 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-12 18:17:51,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:17:51,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 18:17:51,416 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-12 18:17:51,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673330294] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:17:51,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:17:51,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2022-07-12 18:17:51,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519404330] [2022-07-12 18:17:51,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:17:51,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 18:17:51,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:51,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 18:17:51,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-07-12 18:17:51,419 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:51,578 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-07-12 18:17:51,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:17:51,579 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-12 18:17:51,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:51,579 INFO L225 Difference]: With dead ends: 30 [2022-07-12 18:17:51,579 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 18:17:51,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=511, Unknown=0, NotChecked=0, Total=650 [2022-07-12 18:17:51,580 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 88 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:51,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 70 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:17:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 18:17:51,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-07-12 18:17:51,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:51,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-12 18:17:51,582 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2022-07-12 18:17:51,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:51,582 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-12 18:17:51,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.894736842105263) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-12 18:17:51,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 18:17:51,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:51,583 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:51,603 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-12 18:17:51,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 18:17:51,796 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:51,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:51,796 INFO L85 PathProgramCache]: Analyzing trace with hash -271191237, now seen corresponding path program 1 times [2022-07-12 18:17:51,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:51,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560656517] [2022-07-12 18:17:51,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:51,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:51,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:17:51,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:51,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560656517] [2022-07-12 18:17:51,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560656517] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:17:51,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602499637] [2022-07-12 18:17:51,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:51,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:17:51,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:17:51,874 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-12 18:17:51,875 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-12 18:17:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:51,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-12 18:17:51,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:17:51,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:17:51,945 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-12 18:17:51,949 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-12 18:17:52,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:17:52,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:17:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:17:52,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602499637] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:17:52,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:17:52,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2022-07-12 18:17:52,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182896814] [2022-07-12 18:17:52,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:17:52,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-12 18:17:52,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:52,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-12 18:17:52,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-07-12 18:17:52,178 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:52,411 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-07-12 18:17:52,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:17:52,411 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-12 18:17:52,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:52,411 INFO L225 Difference]: With dead ends: 29 [2022-07-12 18:17:52,411 INFO L226 Difference]: Without dead ends: 29 [2022-07-12 18:17:52,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=605, Unknown=0, NotChecked=0, Total=756 [2022-07-12 18:17:52,412 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 58 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:52,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 73 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:17:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-12 18:17:52,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-07-12 18:17:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-07-12 18:17:52,413 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2022-07-12 18:17:52,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:52,413 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-07-12 18:17:52,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:52,414 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-07-12 18:17:52,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:17:52,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:52,414 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:52,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 18:17:52,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 18:17:52,614 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:52,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:52,615 INFO L85 PathProgramCache]: Analyzing trace with hash -224662014, now seen corresponding path program 2 times [2022-07-12 18:17:52,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:52,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389549423] [2022-07-12 18:17:52,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:52,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:52,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:17:52,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:52,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389549423] [2022-07-12 18:17:52,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389549423] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:17:52,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202059016] [2022-07-12 18:17:52,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:17:52,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:17:52,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:17:52,781 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-12 18:17:52,782 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-12 18:17:52,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:17:52,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:17:52,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-12 18:17:52,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:17:52,847 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-12 18:17:52,886 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-12 18:17:53,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:17:53,132 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:17:53,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-07-12 18:17:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:17:53,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:17:53,457 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| Int) (v_ArrVal_188 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_188) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 1)) 0) (<= (+ 3 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-12 18:17:53,469 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| Int) (v_ArrVal_188 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|)) (<= (+ 3 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_188) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_19| 1)) 0))) is different from false [2022-07-12 18:17:53,480 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:17:53,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:17:53,487 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:17:53,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:17:53,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:17:53,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-12 18:17:53,636 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 18:17:53,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202059016] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:17:53,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:17:53,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2022-07-12 18:17:53,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313815222] [2022-07-12 18:17:53,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:17:53,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-12 18:17:53,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:53,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-12 18:17:53,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=950, Unknown=2, NotChecked=126, Total=1190 [2022-07-12 18:17:53,637 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:54,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:54,113 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2022-07-12 18:17:54,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 18:17:54,113 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 18:17:54,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:54,114 INFO L225 Difference]: With dead ends: 48 [2022-07-12 18:17:54,114 INFO L226 Difference]: Without dead ends: 38 [2022-07-12 18:17:54,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=239, Invalid=1929, Unknown=2, NotChecked=182, Total=2352 [2022-07-12 18:17:54,115 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:54,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 141 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 212 Invalid, 0 Unknown, 139 Unchecked, 0.1s Time] [2022-07-12 18:17:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-12 18:17:54,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-07-12 18:17:54,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-07-12 18:17:54,116 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 22 [2022-07-12 18:17:54,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:54,116 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-07-12 18:17:54,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:54,117 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-07-12 18:17:54,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:17:54,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:54,117 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:54,165 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-12 18:17:54,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:17:54,318 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:54,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:54,318 INFO L85 PathProgramCache]: Analyzing trace with hash -121211530, now seen corresponding path program 2 times [2022-07-12 18:17:54,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:54,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209978452] [2022-07-12 18:17:54,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:54,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:54,428 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-12 18:17:54,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:54,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209978452] [2022-07-12 18:17:54,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209978452] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:17:54,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016988314] [2022-07-12 18:17:54,429 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:17:54,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:17:54,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:17:54,430 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-12 18:17:54,431 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-12 18:17:54,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:17:54,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:17:54,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 18:17:54,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:17:54,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:17:54,497 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-12 18:17:54,504 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-12 18:17:54,692 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-12 18:17:54,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:17:54,916 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:17:54,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016988314] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:17:54,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:17:54,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2022-07-12 18:17:54,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592620569] [2022-07-12 18:17:54,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:17:54,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 18:17:54,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:54,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 18:17:54,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2022-07-12 18:17:54,918 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:55,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:55,251 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-07-12 18:17:55,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:17:55,251 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 18:17:55,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:55,251 INFO L225 Difference]: With dead ends: 34 [2022-07-12 18:17:55,252 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 18:17:55,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=1025, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 18:17:55,252 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 84 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:55,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 100 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:17:55,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 18:17:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-07-12 18:17:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 31 states have (on average 1.096774193548387) internal successors, (34), 32 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:55,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-07-12 18:17:55,254 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 27 [2022-07-12 18:17:55,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:55,254 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-07-12 18:17:55,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:55,254 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-07-12 18:17:55,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 18:17:55,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:55,254 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:55,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 18:17:55,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:17:55,455 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:55,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:55,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1054801383, now seen corresponding path program 3 times [2022-07-12 18:17:55,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:55,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720063977] [2022-07-12 18:17:55,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:55,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:55,660 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:17:55,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:55,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720063977] [2022-07-12 18:17:55,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720063977] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:17:55,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632704611] [2022-07-12 18:17:55,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:17:55,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:17:55,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:17:55,668 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-12 18:17:55,669 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-12 18:17:55,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 18:17:55,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:17:55,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 94 conjunts are in the unsatisfiable core [2022-07-12 18:17:55,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:17:55,760 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-12 18:17:55,904 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-12 18:17:56,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:17:56,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:17:56,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:17:56,171 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:17:56,171 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-12 18:17:56,174 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:17:56,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:17:56,185 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|))) is different from false [2022-07-12 18:17:56,191 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:17:56,205 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_260) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:17:56,214 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:17:56,218 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:17:56,223 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:17:56,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:17:56,228 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:17:56,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:17:56,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:17:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-12 18:17:56,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632704611] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:17:56,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:17:56,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 39 [2022-07-12 18:17:56,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106544309] [2022-07-12 18:17:56,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:17:56,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-12 18:17:56,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:56,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-12 18:17:56,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1015, Unknown=5, NotChecked=340, Total=1482 [2022-07-12 18:17:56,387 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:56,672 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-07-12 18:17:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 18:17:56,673 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-12 18:17:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:56,673 INFO L225 Difference]: With dead ends: 54 [2022-07-12 18:17:56,673 INFO L226 Difference]: Without dead ends: 40 [2022-07-12 18:17:56,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 5 IntricatePredicates, 3 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=1553, Unknown=5, NotChecked=420, Total=2162 [2022-07-12 18:17:56,675 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:56,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 163 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 191 Invalid, 0 Unknown, 127 Unchecked, 0.1s Time] [2022-07-12 18:17:56,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-12 18:17:56,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-07-12 18:17:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:56,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-07-12 18:17:56,676 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 30 [2022-07-12 18:17:56,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:56,676 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-07-12 18:17:56,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:56,677 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-07-12 18:17:56,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 18:17:56,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:56,677 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:56,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-12 18:17:56,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:17:56,894 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:56,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:56,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1308342596, now seen corresponding path program 4 times [2022-07-12 18:17:56,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:56,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360649562] [2022-07-12 18:17:56,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:56,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:17:57,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:57,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360649562] [2022-07-12 18:17:57,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360649562] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:17:57,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825397788] [2022-07-12 18:17:57,030 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:17:57,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:17:57,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:17:57,031 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-12 18:17:57,032 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-12 18:17:57,093 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:17:57,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:17:57,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-12 18:17:57,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:17:57,103 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-12 18:17:57,106 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-12 18:17:57,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-12 18:17:57,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-12 18:17:57,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-12 18:17:57,599 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:17:57,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-12 18:17:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:17:57,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:17:58,067 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_307 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 4) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) 0))) is different from false [2022-07-12 18:17:58,079 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_307 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) 0) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|)) (<= (+ |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41| 4) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_41|))) is different from false [2022-07-12 18:17:58,086 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:17:58,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:17:58,092 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:17:58,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:17:58,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:17:58,582 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-12 18:17:58,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825397788] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:17:58,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:17:58,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 16] total 42 [2022-07-12 18:17:58,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491710751] [2022-07-12 18:17:58,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:17:58,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-12 18:17:58,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:17:58,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-12 18:17:58,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1456, Unknown=2, NotChecked=158, Total=1806 [2022-07-12 18:17:58,585 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:59,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:17:59,151 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-07-12 18:17:59,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 18:17:59,153 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 18:17:59,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:17:59,153 INFO L225 Difference]: With dead ends: 43 [2022-07-12 18:17:59,153 INFO L226 Difference]: Without dead ends: 43 [2022-07-12 18:17:59,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=381, Invalid=2595, Unknown=2, NotChecked=214, Total=3192 [2022-07-12 18:17:59,154 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:17:59,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 211 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 250 Invalid, 0 Unknown, 155 Unchecked, 0.1s Time] [2022-07-12 18:17:59,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-12 18:17:59,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-07-12 18:17:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2022-07-12 18:17:59,156 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 34 [2022-07-12 18:17:59,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:17:59,156 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2022-07-12 18:17:59,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.238095238095238) internal successors, (94), 43 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:17:59,156 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-07-12 18:17:59,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-12 18:17:59,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:17:59,156 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:17:59,189 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-12 18:17:59,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:17:59,357 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:17:59,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:17:59,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1903914801, now seen corresponding path program 3 times [2022-07-12 18:17:59,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:17:59,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913720231] [2022-07-12 18:17:59,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:17:59,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:17:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:17:59,502 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:17:59,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:17:59,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913720231] [2022-07-12 18:17:59,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913720231] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:17:59,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858107083] [2022-07-12 18:17:59,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:17:59,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:17:59,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:17:59,503 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-12 18:17:59,504 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-12 18:17:59,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 18:17:59,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:17:59,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-12 18:17:59,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:17:59,591 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:17:59,592 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-12 18:17:59,598 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-12 18:17:59,906 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 18:17:59,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-12 18:18:00,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858107083] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:00,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:00,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2022-07-12 18:18:00,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847938678] [2022-07-12 18:18:00,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:00,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 18:18:00,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:00,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 18:18:00,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2022-07-12 18:18:00,269 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:01,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:01,237 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2022-07-12 18:18:01,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 18:18:01,237 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-12 18:18:01,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:01,238 INFO L225 Difference]: With dead ends: 56 [2022-07-12 18:18:01,238 INFO L226 Difference]: Without dead ends: 56 [2022-07-12 18:18:01,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=437, Invalid=2113, Unknown=0, NotChecked=0, Total=2550 [2022-07-12 18:18:01,239 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 90 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:01,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 125 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 367 Invalid, 0 Unknown, 11 Unchecked, 0.2s Time] [2022-07-12 18:18:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-12 18:18:01,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2022-07-12 18:18:01,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:01,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-07-12 18:18:01,241 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 35 [2022-07-12 18:18:01,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:01,241 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-07-12 18:18:01,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:01,241 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-07-12 18:18:01,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 18:18:01,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:01,242 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:01,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-12 18:18:01,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-12 18:18:01,459 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:18:01,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:01,459 INFO L85 PathProgramCache]: Analyzing trace with hash 187721292, now seen corresponding path program 5 times [2022-07-12 18:18:01,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:01,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273775126] [2022-07-12 18:18:01,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:01,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:01,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:01,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273775126] [2022-07-12 18:18:01,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273775126] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:01,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373044014] [2022-07-12 18:18:01,744 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:18:01,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:01,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:01,745 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-12 18:18:01,745 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-12 18:18:01,842 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-12 18:18:01,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:18:01,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-12 18:18:01,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:02,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-12 18:18:02,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:18:02,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 22 treesize of output 21 [2022-07-12 18:18:02,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:18:02,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:18:02,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:18:02,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-12 18:18:02,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:18:02,468 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:02,469 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-12 18:18:02,472 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:02,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:02,932 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset|)))) is different from false [2022-07-12 18:18:46,867 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset|)) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) is different from false [2022-07-12 18:18:48,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| Int)) (or (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (< |c_ULTIMATE.start_main_~nondetArea~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59|) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) is different from false [2022-07-12 18:18:48,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 776 treesize of output 764 [2022-07-12 18:18:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-12 18:18:50,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373044014] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:50,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:50,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 49 [2022-07-12 18:18:50,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641416634] [2022-07-12 18:18:50,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:50,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-12 18:18:50,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:50,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-12 18:18:50,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1922, Unknown=17, NotChecked=270, Total=2352 [2022-07-12 18:18:50,064 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:52,412 WARN L833 $PredicateComparison]: unable to prove that (and (< 3 |c_ULTIMATE.start_main_~length2~0#1|) (<= |c_ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 4 |c_ULTIMATE.start_main_~length2~0#1|) (<= |c_ULTIMATE.start_main_~length2~0#1| 4) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| Int)) (or (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (< |c_ULTIMATE.start_main_~nondetArea~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59|) (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (<= |ULTIMATE.start_main_~length2~0#1| 4) (< 3 |ULTIMATE.start_main_~length2~0#1|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0))) (<= 0 |c_ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |c_ULTIMATE.start_main_~i~0#1| 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:54,431 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| Int) (v_ArrVal_398 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| Int) (v_ArrVal_396 Int) (|v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| Int) (v_ArrVal_394 Int) (|v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47| (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrcpy_~dst~0#1.base_47|) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| v_ArrVal_394) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| v_ArrVal_396) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55| v_ArrVal_398)) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_55|) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset|)) (< (+ |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_59| 1) |v_ULTIMATE.start_cstrcpy_#t~post2#1.offset_57|))) (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (<= |ULTIMATE.start_main_~length2~0#1| 4) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length2~0#1| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0) (< 3 |ULTIMATE.start_main_~length2~0#1|))) (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) 3) 0) (<= |c_ULTIMATE.start_cstrcpy_~dst~0#1.offset| 0) (not (= |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) is different from false [2022-07-12 18:18:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:55,690 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-07-12 18:18:55,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 18:18:55,690 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-12 18:18:55,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:55,691 INFO L225 Difference]: With dead ends: 78 [2022-07-12 18:18:55,692 INFO L226 Difference]: Without dead ends: 60 [2022-07-12 18:18:55,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 52.5s TimeCoverageRelationStatistics Valid=250, Invalid=3291, Unknown=19, NotChecked=600, Total=4160 [2022-07-12 18:18:55,693 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:55,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 343 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 397 Invalid, 0 Unknown, 260 Unchecked, 0.2s Time] [2022-07-12 18:18:55,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-12 18:18:55,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-07-12 18:18:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-07-12 18:18:55,695 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 38 [2022-07-12 18:18:55,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:55,695 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-07-12 18:18:55,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.9387755102040816) internal successors, (95), 49 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-07-12 18:18:55,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 18:18:55,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:55,696 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:55,713 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-12 18:18:55,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-12 18:18:55,910 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:18:55,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:55,910 INFO L85 PathProgramCache]: Analyzing trace with hash 406746281, now seen corresponding path program 6 times [2022-07-12 18:18:55,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:55,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476048991] [2022-07-12 18:18:55,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:55,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:56,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:56,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476048991] [2022-07-12 18:18:56,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476048991] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:56,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861307758] [2022-07-12 18:18:56,095 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:18:56,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:56,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:56,098 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-12 18:18:56,099 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-12 18:18:56,193 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-12 18:18:56,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:18:56,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-12 18:18:56,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:56,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:56,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-07-12 18:18:56,670 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:56,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861307758] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:56,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:56,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2022-07-12 18:18:56,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594573986] [2022-07-12 18:18:56,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:56,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-12 18:18:56,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:56,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-12 18:18:56,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 18:18:56,671 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 34 states, 33 states have (on average 3.090909090909091) internal successors, (102), 34 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:57,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:57,038 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2022-07-12 18:18:57,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 18:18:57,038 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.090909090909091) internal successors, (102), 34 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-12 18:18:57,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:57,038 INFO L225 Difference]: With dead ends: 57 [2022-07-12 18:18:57,039 INFO L226 Difference]: Without dead ends: 57 [2022-07-12 18:18:57,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=437, Invalid=1633, Unknown=0, NotChecked=0, Total=2070 [2022-07-12 18:18:57,040 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 266 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:57,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 146 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:18:57,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-12 18:18:57,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-07-12 18:18:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 56 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2022-07-12 18:18:57,041 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 42 [2022-07-12 18:18:57,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:57,041 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2022-07-12 18:18:57,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.090909090909091) internal successors, (102), 34 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:57,042 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2022-07-12 18:18:57,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 18:18:57,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:57,042 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:57,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-12 18:18:57,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-12 18:18:57,260 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:18:57,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash 892135217, now seen corresponding path program 7 times [2022-07-12 18:18:57,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:57,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547938956] [2022-07-12 18:18:57,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:57,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:57,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:57,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547938956] [2022-07-12 18:18:57,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547938956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:57,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559869961] [2022-07-12 18:18:57,638 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 18:18:57,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:57,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:57,639 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-12 18:18:57,639 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-12 18:18:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:57,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-12 18:18:57,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:57,731 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-12 18:18:57,916 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-12 18:18:58,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:58,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:58,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:58,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:58,166 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-12 18:18:58,168 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:58,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:58,176 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-12 18:18:58,181 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:58,186 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_502) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:58,192 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:58,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_501 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_501) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:58,204 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:58,210 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int)) (v_ArrVal_500 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_500) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:58,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:58,221 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2022-07-12 18:18:58,225 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:58,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:18:58,231 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:58,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:18:58,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:18:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 39 not checked. [2022-07-12 18:18:58,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559869961] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:58,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:58,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 48 [2022-07-12 18:18:58,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376012661] [2022-07-12 18:18:58,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:58,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-12 18:18:58,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:58,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-12 18:18:58,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1375, Unknown=9, NotChecked=738, Total=2256 [2022-07-12 18:18:58,418 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:59,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:59,058 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-07-12 18:18:59,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 18:18:59,058 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-12 18:18:59,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:59,059 INFO L225 Difference]: With dead ends: 86 [2022-07-12 18:18:59,059 INFO L226 Difference]: Without dead ends: 64 [2022-07-12 18:18:59,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 65 SyntacticMatches, 15 SemanticMatches, 55 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=196, Invalid=2087, Unknown=9, NotChecked=900, Total=3192 [2022-07-12 18:18:59,060 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 388 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:59,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 343 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 512 Invalid, 0 Unknown, 388 Unchecked, 0.2s Time] [2022-07-12 18:18:59,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-12 18:18:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2022-07-12 18:18:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-07-12 18:18:59,061 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 46 [2022-07-12 18:18:59,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:59,061 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-07-12 18:18:59,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.0625) internal successors, (99), 48 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-07-12 18:18:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 18:18:59,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:59,062 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:59,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-12 18:18:59,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 18:18:59,275 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:18:59,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:59,276 INFO L85 PathProgramCache]: Analyzing trace with hash -282507122, now seen corresponding path program 8 times [2022-07-12 18:18:59,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:59,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774329344] [2022-07-12 18:18:59,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:59,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:59,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:59,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774329344] [2022-07-12 18:18:59,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774329344] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:59,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319995159] [2022-07-12 18:18:59,477 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:18:59,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:59,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:59,478 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-12 18:18:59,479 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-12 18:18:59,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:18:59,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:18:59,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-12 18:18:59,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:59,766 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:59,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:00,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 18:19:00,038 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:00,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319995159] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:00,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:00,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2022-07-12 18:19:00,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985700833] [2022-07-12 18:19:00,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:00,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-12 18:19:00,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:00,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-12 18:19:00,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2022-07-12 18:19:00,039 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:00,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:00,531 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-07-12 18:19:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 18:19:00,532 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-12 18:19:00,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:00,532 INFO L225 Difference]: With dead ends: 61 [2022-07-12 18:19:00,532 INFO L226 Difference]: Without dead ends: 61 [2022-07-12 18:19:00,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=449, Invalid=1903, Unknown=0, NotChecked=0, Total=2352 [2022-07-12 18:19:00,533 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 84 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:00,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 221 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:19:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-12 18:19:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-07-12 18:19:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 60 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-07-12 18:19:00,535 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 50 [2022-07-12 18:19:00,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:00,535 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-07-12 18:19:00,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-07-12 18:19:00,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-12 18:19:00,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:00,536 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:00,553 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-12 18:19:00,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-12 18:19:00,748 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:19:00,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:00,748 INFO L85 PathProgramCache]: Analyzing trace with hash 823214230, now seen corresponding path program 9 times [2022-07-12 18:19:00,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:00,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769836027] [2022-07-12 18:19:00,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:00,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:01,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:01,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769836027] [2022-07-12 18:19:01,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769836027] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:01,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89469271] [2022-07-12 18:19:01,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:19:01,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:01,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:01,241 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-12 18:19:01,241 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-12 18:19:01,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-12 18:19:01,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:19:01,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 153 conjunts are in the unsatisfiable core [2022-07-12 18:19:01,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:01,468 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-12 18:19:01,785 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-12 18:19:01,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:02,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:02,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:02,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:02,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:02,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:19:02,512 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:02,512 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-12 18:19:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:02,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:02,523 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-12 18:19:02,529 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:02,537 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_622 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_622) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:02,543 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:02,552 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_621) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:02,557 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:02,568 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_620 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_620) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:02,573 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:02,582 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int)) (v_ArrVal_619 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_619) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:02,590 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:02,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_623 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_623) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:02,599 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:02,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:19:02,603 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:02,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:19:02,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:19:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 59 not checked. [2022-07-12 18:19:02,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89469271] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:02,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:02,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 24] total 69 [2022-07-12 18:19:02,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338172490] [2022-07-12 18:19:02,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:02,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-12 18:19:02,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:02,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-12 18:19:02,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=3127, Unknown=11, NotChecked=1342, Total=4692 [2022-07-12 18:19:02,923 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:04,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:04,071 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2022-07-12 18:19:04,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-12 18:19:04,072 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-07-12 18:19:04,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:04,072 INFO L225 Difference]: With dead ends: 94 [2022-07-12 18:19:04,072 INFO L226 Difference]: Without dead ends: 68 [2022-07-12 18:19:04,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 11 IntricatePredicates, 5 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=361, Invalid=5834, Unknown=11, NotChecked=1804, Total=8010 [2022-07-12 18:19:04,074 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 48 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 727 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:04,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 533 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 706 Invalid, 0 Unknown, 727 Unchecked, 0.3s Time] [2022-07-12 18:19:04,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-12 18:19:04,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-07-12 18:19:04,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 64 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2022-07-12 18:19:04,076 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 54 [2022-07-12 18:19:04,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:04,076 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2022-07-12 18:19:04,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:04,076 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-07-12 18:19:04,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 18:19:04,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:04,077 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:04,094 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-12 18:19:04,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-12 18:19:04,294 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:19:04,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:04,294 INFO L85 PathProgramCache]: Analyzing trace with hash -101124877, now seen corresponding path program 10 times [2022-07-12 18:19:04,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:04,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626385163] [2022-07-12 18:19:04,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:04,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 28 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:04,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:04,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626385163] [2022-07-12 18:19:04,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626385163] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:04,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699548479] [2022-07-12 18:19:04,514 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:19:04,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:04,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:04,515 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-12 18:19:04,515 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-12 18:19:04,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:19:04,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:19:04,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-12 18:19:04,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:04,612 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-12 18:19:04,619 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-12 18:19:04,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-12 18:19:05,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:19:05,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:19:05,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:19:05,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:19:05,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:19:05,519 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:05,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 18:19:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 50 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:05,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:06,420 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_696 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121| Int)) (or (<= (+ 7 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) 0) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-12 18:19:06,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_696 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121| Int)) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) (<= (+ 7 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_696) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_121|)) 0))) is different from false [2022-07-12 18:19:06,444 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:06,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:19:06,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:06,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:19:06,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:19:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-12 18:19:07,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699548479] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:07,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:07,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 25, 25] total 66 [2022-07-12 18:19:07,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643186241] [2022-07-12 18:19:07,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:07,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-12 18:19:07,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:07,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-12 18:19:07,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=3727, Unknown=5, NotChecked=254, Total=4422 [2022-07-12 18:19:07,412 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 67 states, 66 states have (on average 2.515151515151515) internal successors, (166), 67 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:09,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:09,269 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2022-07-12 18:19:09,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 18:19:09,270 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 2.515151515151515) internal successors, (166), 67 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-07-12 18:19:09,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:09,271 INFO L225 Difference]: With dead ends: 68 [2022-07-12 18:19:09,271 INFO L226 Difference]: Without dead ends: 68 [2022-07-12 18:19:09,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1362 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1144, Invalid=6836, Unknown=38, NotChecked=354, Total=8372 [2022-07-12 18:19:09,273 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 111 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 438 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:09,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 361 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 780 Invalid, 0 Unknown, 438 Unchecked, 0.4s Time] [2022-07-12 18:19:09,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-12 18:19:09,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-12 18:19:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 67 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2022-07-12 18:19:09,274 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 58 [2022-07-12 18:19:09,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:09,275 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2022-07-12 18:19:09,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 2.515151515151515) internal successors, (166), 67 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-07-12 18:19:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 18:19:09,275 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:09,275 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:09,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 18:19:09,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:09,494 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:19:09,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:09,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2106334426, now seen corresponding path program 4 times [2022-07-12 18:19:09,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:09,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224488941] [2022-07-12 18:19:09,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:09,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 85 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:09,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:09,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224488941] [2022-07-12 18:19:09,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224488941] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:09,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270365020] [2022-07-12 18:19:09,756 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:19:09,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:09,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:09,758 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-12 18:19:09,760 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-12 18:19:09,853 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:19:09,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:19:09,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-12 18:19:09,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:09,868 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:19:09,868 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-12 18:19:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 92 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:10,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 91 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:10,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270365020] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:10,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:10,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 47 [2022-07-12 18:19:10,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503859674] [2022-07-12 18:19:10,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:10,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-12 18:19:10,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:10,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-12 18:19:10,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=1803, Unknown=0, NotChecked=0, Total=2162 [2022-07-12 18:19:10,584 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:11,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:11,089 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2022-07-12 18:19:11,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 18:19:11,089 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-07-12 18:19:11,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:11,089 INFO L225 Difference]: With dead ends: 107 [2022-07-12 18:19:11,089 INFO L226 Difference]: Without dead ends: 75 [2022-07-12 18:19:11,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=859, Invalid=3173, Unknown=0, NotChecked=0, Total=4032 [2022-07-12 18:19:11,090 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 80 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:11,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 120 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:19:11,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-12 18:19:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-07-12 18:19:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 70 states have (on average 1.042857142857143) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2022-07-12 18:19:11,092 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 63 [2022-07-12 18:19:11,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:11,092 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-07-12 18:19:11,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:11,092 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2022-07-12 18:19:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-12 18:19:11,092 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:11,092 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:11,110 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-12 18:19:11,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:11,293 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:19:11,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:11,293 INFO L85 PathProgramCache]: Analyzing trace with hash 717029661, now seen corresponding path program 5 times [2022-07-12 18:19:11,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:11,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593826723] [2022-07-12 18:19:11,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:11,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 45 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:11,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:11,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593826723] [2022-07-12 18:19:11,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593826723] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:11,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476008523] [2022-07-12 18:19:11,550 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:19:11,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:11,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:11,551 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-12 18:19:11,551 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-12 18:19:11,749 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-07-12 18:19:11,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:19:11,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 98 conjunts are in the unsatisfiable core [2022-07-12 18:19:11,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:11,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:19:11,762 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-12 18:19:11,764 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-12 18:19:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 66 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:12,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:12,833 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:12,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476008523] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:12,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:12,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 52 [2022-07-12 18:19:12,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886873624] [2022-07-12 18:19:12,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:12,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-12 18:19:12,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:12,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-12 18:19:12,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=2413, Unknown=0, NotChecked=0, Total=2756 [2022-07-12 18:19:12,835 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 53 states, 52 states have (on average 3.5961538461538463) internal successors, (187), 53 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:13,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:13,486 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-07-12 18:19:13,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 18:19:13,487 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 3.5961538461538463) internal successors, (187), 53 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-07-12 18:19:13,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:13,487 INFO L225 Difference]: With dead ends: 74 [2022-07-12 18:19:13,487 INFO L226 Difference]: Without dead ends: 74 [2022-07-12 18:19:13,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=913, Invalid=4057, Unknown=0, NotChecked=0, Total=4970 [2022-07-12 18:19:13,488 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 80 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:13,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 276 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:19:13,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-12 18:19:13,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-07-12 18:19:13,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 72 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2022-07-12 18:19:13,490 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 67 [2022-07-12 18:19:13,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:13,490 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2022-07-12 18:19:13,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.5961538461538463) internal successors, (187), 53 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:13,490 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2022-07-12 18:19:13,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-12 18:19:13,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:13,491 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:13,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-12 18:19:13,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:13,704 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:19:13,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:13,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2136703776, now seen corresponding path program 11 times [2022-07-12 18:19:13,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:13,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819344651] [2022-07-12 18:19:13,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:13,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:14,445 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:14,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:14,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819344651] [2022-07-12 18:19:14,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819344651] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:14,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686144724] [2022-07-12 18:19:14,445 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:19:14,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:14,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:14,447 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-12 18:19:14,447 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-12 18:19:14,831 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-07-12 18:19:14,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:19:14,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 145 conjunts are in the unsatisfiable core [2022-07-12 18:19:14,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:14,853 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-12 18:19:15,174 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-12 18:19:15,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-12 18:19:15,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:15,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:15,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-12 18:19:15,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:15,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-12 18:19:15,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:15,590 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-12 18:19:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:15,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:15,602 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-12 18:19:15,606 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:15,610 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_923 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_922) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:15,615 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:15,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_921 (Array Int Int)) (v_ArrVal_923 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_921) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:15,624 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:15,629 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (v_ArrVal_923 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_920) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:15,633 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:15,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int)) (v_ArrVal_919 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_919) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:15,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:15,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int)) (v_ArrVal_918 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_918) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:15,652 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:15,656 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int)) (v_ArrVal_917 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_917) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:15,661 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:15,665 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 7 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:15,668 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:15,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:19:15,672 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:15,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:19:15,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:19:15,913 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 16 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 111 not checked. [2022-07-12 18:19:15,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686144724] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:15,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:15,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30, 30] total 72 [2022-07-12 18:19:15,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331789378] [2022-07-12 18:19:15,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:15,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-12 18:19:15,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:15,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-12 18:19:15,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=3037, Unknown=15, NotChecked=1860, Total=5112 [2022-07-12 18:19:15,915 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 72 states, 72 states have (on average 2.1666666666666665) internal successors, (156), 72 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:17,289 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2022-07-12 18:19:17,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-12 18:19:17,289 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.1666666666666665) internal successors, (156), 72 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-07-12 18:19:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:17,290 INFO L225 Difference]: With dead ends: 114 [2022-07-12 18:19:17,290 INFO L226 Difference]: Without dead ends: 80 [2022-07-12 18:19:17,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 101 SyntacticMatches, 16 SemanticMatches, 86 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=299, Invalid=5002, Unknown=15, NotChecked=2340, Total=7656 [2022-07-12 18:19:17,291 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 45 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 2540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1207 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:17,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 678 Invalid, 2540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1305 Invalid, 0 Unknown, 1207 Unchecked, 0.5s Time] [2022-07-12 18:19:17,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-12 18:19:17,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2022-07-12 18:19:17,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 75 states have (on average 1.04) internal successors, (78), 76 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-07-12 18:19:17,292 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 70 [2022-07-12 18:19:17,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:17,292 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-07-12 18:19:17,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.1666666666666665) internal successors, (156), 72 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-07-12 18:19:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-12 18:19:17,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:17,293 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:17,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-12 18:19:17,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:17,504 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:19:17,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1499060029, now seen corresponding path program 12 times [2022-07-12 18:19:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:17,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277080523] [2022-07-12 18:19:17,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:17,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:17,801 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 66 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:17,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:17,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277080523] [2022-07-12 18:19:17,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277080523] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:17,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401754611] [2022-07-12 18:19:17,802 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:19:17,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:17,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:17,803 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-12 18:19:17,804 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-12 18:19:18,353 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-07-12 18:19:18,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:19:18,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-12 18:19:18,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:18,370 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:19:18,370 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-12 18:19:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 91 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:19,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 120 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:19,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401754611] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:19,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:19,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 61 [2022-07-12 18:19:19,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391635361] [2022-07-12 18:19:19,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:19,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-07-12 18:19:19,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:19,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-07-12 18:19:19,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=3314, Unknown=0, NotChecked=0, Total=3782 [2022-07-12 18:19:19,790 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 62 states, 61 states have (on average 3.5081967213114753) internal successors, (214), 62 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:21,084 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2022-07-12 18:19:21,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 18:19:21,084 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 3.5081967213114753) internal successors, (214), 62 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-07-12 18:19:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:21,085 INFO L225 Difference]: With dead ends: 83 [2022-07-12 18:19:21,085 INFO L226 Difference]: Without dead ends: 83 [2022-07-12 18:19:21,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1372 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1560, Invalid=6272, Unknown=0, NotChecked=0, Total=7832 [2022-07-12 18:19:21,086 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 319 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:21,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 236 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:19:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-12 18:19:21,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2022-07-12 18:19:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 79 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2022-07-12 18:19:21,088 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 74 [2022-07-12 18:19:21,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:21,088 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2022-07-12 18:19:21,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 3.5081967213114753) internal successors, (214), 62 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-07-12 18:19:21,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-12 18:19:21,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:21,089 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:21,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-12 18:19:21,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:21,304 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:19:21,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:21,305 INFO L85 PathProgramCache]: Analyzing trace with hash -773779368, now seen corresponding path program 6 times [2022-07-12 18:19:21,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:21,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942977313] [2022-07-12 18:19:21,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:21,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 66 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:21,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:21,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942977313] [2022-07-12 18:19:21,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942977313] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:21,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137854628] [2022-07-12 18:19:21,669 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:19:21,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:21,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:21,670 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-12 18:19:21,691 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-12 18:19:22,212 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-07-12 18:19:22,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:19:22,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-12 18:19:22,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:22,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:19:22,228 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-12 18:19:22,230 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-12 18:19:22,878 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 91 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:22,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:23,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137854628] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:23,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:23,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 62 [2022-07-12 18:19:23,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563172820] [2022-07-12 18:19:23,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:23,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-12 18:19:23,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:23,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-12 18:19:23,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=3426, Unknown=0, NotChecked=0, Total=3906 [2022-07-12 18:19:23,709 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 63 states, 62 states have (on average 3.5) internal successors, (217), 63 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:25,007 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-07-12 18:19:25,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 18:19:25,008 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 3.5) internal successors, (217), 63 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2022-07-12 18:19:25,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:25,008 INFO L225 Difference]: With dead ends: 82 [2022-07-12 18:19:25,008 INFO L226 Difference]: Without dead ends: 82 [2022-07-12 18:19:25,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1417 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1573, Invalid=6437, Unknown=0, NotChecked=0, Total=8010 [2022-07-12 18:19:25,009 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 415 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:25,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 214 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:19:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-12 18:19:25,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-07-12 18:19:25,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 80 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:25,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2022-07-12 18:19:25,011 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 75 [2022-07-12 18:19:25,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:25,011 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2022-07-12 18:19:25,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 3.5) internal successors, (217), 63 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2022-07-12 18:19:25,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-12 18:19:25,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:25,012 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:25,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-12 18:19:25,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:25,225 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:19:25,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:25,225 INFO L85 PathProgramCache]: Analyzing trace with hash -571678779, now seen corresponding path program 13 times [2022-07-12 18:19:25,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:25,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355772947] [2022-07-12 18:19:25,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:25,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:26,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:26,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355772947] [2022-07-12 18:19:26,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355772947] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:26,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846260046] [2022-07-12 18:19:26,106 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 18:19:26,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:26,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:26,107 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-12 18:19:26,107 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-12 18:19:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:26,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 162 conjunts are in the unsatisfiable core [2022-07-12 18:19:26,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:26,249 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-12 18:19:26,665 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-12 18:19:26,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:26,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:26,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:27,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:27,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:27,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:27,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:27,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 18:19:27,296 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-12 18:19:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:27,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:27,308 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-12 18:19:27,313 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:27,319 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1176) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:27,324 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:27,333 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1175 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1175) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:27,339 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:27,344 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1174 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1174) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:27,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:27,355 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1173 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1173) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:27,361 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:27,370 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1172 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1172) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:27,375 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:27,382 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1171) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:27,387 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:27,395 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1170 (Array Int Int)) (v_ArrVal_1177 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1170) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:27,400 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:27,418 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1177) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:27,422 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:27,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:19:27,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:27,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:19:27,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:19:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 143 not checked. [2022-07-12 18:19:27,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846260046] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:27,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:27,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 33, 33] total 82 [2022-07-12 18:19:27,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906111792] [2022-07-12 18:19:27,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:27,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-07-12 18:19:27,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:27,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-07-12 18:19:27,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3981, Unknown=17, NotChecked=2414, Total=6642 [2022-07-12 18:19:27,806 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 82 states, 82 states have (on average 2.1707317073170733) internal successors, (178), 82 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:29,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:29,714 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2022-07-12 18:19:29,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-12 18:19:29,715 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 2.1707317073170733) internal successors, (178), 82 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-07-12 18:19:29,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:29,718 INFO L225 Difference]: With dead ends: 126 [2022-07-12 18:19:29,718 INFO L226 Difference]: Without dead ends: 88 [2022-07-12 18:19:29,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 106 SyntacticMatches, 25 SemanticMatches, 100 ConstructedPredicates, 17 IntricatePredicates, 1 DeprecatedPredicates, 2001 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=354, Invalid=6837, Unknown=17, NotChecked=3094, Total=10302 [2022-07-12 18:19:29,719 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 54 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 3045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1415 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:29,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 803 Invalid, 3045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1590 Invalid, 0 Unknown, 1415 Unchecked, 0.6s Time] [2022-07-12 18:19:29,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-12 18:19:29,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2022-07-12 18:19:29,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 83 states have (on average 1.036144578313253) internal successors, (86), 84 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:29,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2022-07-12 18:19:29,724 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 78 [2022-07-12 18:19:29,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:29,725 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2022-07-12 18:19:29,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 2.1707317073170733) internal successors, (178), 82 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:29,725 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-07-12 18:19:29,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 18:19:29,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:29,731 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:29,749 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-12 18:19:29,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-12 18:19:29,947 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:19:29,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:29,948 INFO L85 PathProgramCache]: Analyzing trace with hash 495226146, now seen corresponding path program 14 times [2022-07-12 18:19:29,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:29,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123962782] [2022-07-12 18:19:29,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:29,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 91 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:30,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:30,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123962782] [2022-07-12 18:19:30,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123962782] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:30,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866228813] [2022-07-12 18:19:30,276 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:19:30,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:30,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:30,284 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-12 18:19:30,285 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-12 18:19:30,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:19:30,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:19:30,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 102 conjunts are in the unsatisfiable core [2022-07-12 18:19:30,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:30,429 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:19:30,429 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-12 18:19:31,228 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 120 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:31,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 153 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:32,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866228813] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:32,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:32,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 67 [2022-07-12 18:19:32,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185932232] [2022-07-12 18:19:32,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:32,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-07-12 18:19:32,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:32,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-07-12 18:19:32,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=484, Invalid=4072, Unknown=0, NotChecked=0, Total=4556 [2022-07-12 18:19:32,198 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 68 states, 67 states have (on average 3.5522388059701493) internal successors, (238), 68 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:33,723 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2022-07-12 18:19:33,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 18:19:33,723 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 3.5522388059701493) internal successors, (238), 68 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-07-12 18:19:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:33,724 INFO L225 Difference]: With dead ends: 91 [2022-07-12 18:19:33,724 INFO L226 Difference]: Without dead ends: 91 [2022-07-12 18:19:33,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1911 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1706, Invalid=7800, Unknown=0, NotChecked=0, Total=9506 [2022-07-12 18:19:33,724 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 354 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:33,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 432 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:19:33,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-12 18:19:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2022-07-12 18:19:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 87 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2022-07-12 18:19:33,726 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 82 [2022-07-12 18:19:33,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:33,726 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-07-12 18:19:33,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 3.5522388059701493) internal successors, (238), 68 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:33,726 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2022-07-12 18:19:33,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-12 18:19:33,727 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:33,727 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:33,746 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-12 18:19:33,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-12 18:19:33,943 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:19:33,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:33,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1827858669, now seen corresponding path program 7 times [2022-07-12 18:19:33,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:33,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889218174] [2022-07-12 18:19:33,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:33,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:34,325 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 91 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:34,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:34,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889218174] [2022-07-12 18:19:34,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889218174] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:34,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111583359] [2022-07-12 18:19:34,326 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 18:19:34,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:34,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:34,327 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-12 18:19:34,328 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-12 18:19:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:34,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 111 conjunts are in the unsatisfiable core [2022-07-12 18:19:34,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:34,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:19:34,480 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-12 18:19:34,482 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-12 18:19:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 120 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:35,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:36,238 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:36,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111583359] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:36,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:36,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 68 [2022-07-12 18:19:36,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541484579] [2022-07-12 18:19:36,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:36,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-12 18:19:36,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:36,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-12 18:19:36,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=4196, Unknown=0, NotChecked=0, Total=4692 [2022-07-12 18:19:36,240 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 69 states, 68 states have (on average 3.5441176470588234) internal successors, (241), 69 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:37,715 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-07-12 18:19:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 18:19:37,716 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 3.5441176470588234) internal successors, (241), 69 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-07-12 18:19:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:37,716 INFO L225 Difference]: With dead ends: 90 [2022-07-12 18:19:37,716 INFO L226 Difference]: Without dead ends: 90 [2022-07-12 18:19:37,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1719, Invalid=7983, Unknown=0, NotChecked=0, Total=9702 [2022-07-12 18:19:37,717 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 568 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:37,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 378 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:19:37,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-12 18:19:37,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2022-07-12 18:19:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 87 states have (on average 1.0344827586206897) internal successors, (90), 88 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:37,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2022-07-12 18:19:37,718 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 83 [2022-07-12 18:19:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:37,718 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2022-07-12 18:19:37,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 3.5441176470588234) internal successors, (241), 69 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-07-12 18:19:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-12 18:19:37,719 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:37,719 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:37,736 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-12 18:19:37,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-12 18:19:37,933 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:19:37,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:37,933 INFO L85 PathProgramCache]: Analyzing trace with hash -2142233814, now seen corresponding path program 15 times [2022-07-12 18:19:37,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:37,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696228396] [2022-07-12 18:19:37,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:37,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 20 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:38,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:38,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696228396] [2022-07-12 18:19:38,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696228396] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:38,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009468546] [2022-07-12 18:19:38,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:19:38,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:38,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:38,918 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-12 18:19:38,919 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-12 18:19:39,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-12 18:19:39,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:19:39,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 229 conjunts are in the unsatisfiable core [2022-07-12 18:19:39,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:39,889 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-12 18:19:40,469 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-12 18:19:40,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:40,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:40,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:41,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:41,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:41,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:41,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:41,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:41,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:41,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:19:41,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:41,945 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-12 18:19:41,948 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 20 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:41,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:41,956 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-12 18:19:41,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:41,966 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1456 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1456) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:41,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:41,977 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1455 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1455) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:41,983 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:41,988 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1454) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-12 18:19:41,994 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:41,999 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1453 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1453) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:42,004 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:42,009 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1452) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:42,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:42,019 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1451) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:42,024 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:42,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1450 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1450) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:42,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:42,039 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1449 (Array Int Int)) (v_ArrVal_1457 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1449) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:42,044 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:42,048 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:42,053 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:42,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:19:42,058 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:42,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:19:42,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:19:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 20 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 179 not checked. [2022-07-12 18:19:42,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009468546] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:42,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:42,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 36, 36] total 109 [2022-07-12 18:19:42,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069219552] [2022-07-12 18:19:42,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:42,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2022-07-12 18:19:42,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:42,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2022-07-12 18:19:42,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=7735, Unknown=19, NotChecked=3686, Total=11772 [2022-07-12 18:19:42,697 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand has 109 states, 109 states have (on average 2.1926605504587156) internal successors, (239), 109 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:45,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:45,001 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2022-07-12 18:19:45,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-12 18:19:45,001 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 2.1926605504587156) internal successors, (239), 109 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-07-12 18:19:45,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:45,004 INFO L225 Difference]: With dead ends: 138 [2022-07-12 18:19:45,004 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 18:19:45,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 115 SyntacticMatches, 5 SemanticMatches, 136 ConstructedPredicates, 19 IntricatePredicates, 6 DeprecatedPredicates, 3987 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=533, Invalid=13566, Unknown=19, NotChecked=4788, Total=18906 [2022-07-12 18:19:45,009 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 51 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 3556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2070 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:45,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1357 Invalid, 3556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1470 Invalid, 0 Unknown, 2070 Unchecked, 0.5s Time] [2022-07-12 18:19:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 18:19:45,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2022-07-12 18:19:45,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.032967032967033) internal successors, (94), 92 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:45,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2022-07-12 18:19:45,010 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 86 [2022-07-12 18:19:45,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:45,011 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2022-07-12 18:19:45,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 2.1926605504587156) internal successors, (239), 109 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-07-12 18:19:45,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-12 18:19:45,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:45,011 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:45,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-07-12 18:19:45,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:45,228 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:19:45,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:45,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1422334855, now seen corresponding path program 16 times [2022-07-12 18:19:45,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:45,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174610849] [2022-07-12 18:19:45,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:45,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:45,650 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 120 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:45,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:45,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174610849] [2022-07-12 18:19:45,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174610849] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:45,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495301439] [2022-07-12 18:19:45,650 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:19:45,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:45,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:45,651 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-12 18:19:45,652 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-12 18:19:45,806 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:19:45,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:19:45,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 174 conjunts are in the unsatisfiable core [2022-07-12 18:19:45,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:45,826 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:19:45,826 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-12 18:19:45,833 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-12 18:19:46,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-12 18:19:46,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-12 18:19:46,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-12 18:19:46,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-12 18:19:46,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-12 18:19:47,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-12 18:19:47,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-12 18:19:47,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-12 18:19:47,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-12 18:19:47,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-12 18:19:47,978 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:47,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-07-12 18:19:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 162 proven. 228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:48,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:50,022 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1565 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311| Int)) (or (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (<= (+ 11 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|)) 0))) is different from false [2022-07-12 18:19:50,032 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1565 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1565) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|)) 0) (<= (+ 11 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_311|))) is different from false [2022-07-12 18:19:50,038 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:50,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:19:50,043 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:50,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:19:50,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:19:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 190 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-12 18:19:51,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495301439] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:51,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:51,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 37, 37] total 98 [2022-07-12 18:19:51,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433482317] [2022-07-12 18:19:51,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:51,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 99 states [2022-07-12 18:19:51,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:51,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2022-07-12 18:19:51,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=883, Invalid=8428, Unknown=9, NotChecked=382, Total=9702 [2022-07-12 18:19:51,800 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand has 99 states, 98 states have (on average 2.673469387755102) internal successors, (262), 99 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:54,765 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse1 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|))) (and (= (+ |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (or (and (<= 0 .cse0) (<= (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse1)) (forall ((v_ArrVal_1565 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1565) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0))) (= |c_ULTIMATE.start_cstrcpy_#t~post3#1.base| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (exists ((|ULTIMATE.start_main_~nondetString~0#1.offset| Int)) (let ((.cse2 (select |c_#length| |c_ULTIMATE.start_cstrcpy_#t~post3#1.base|))) (and (<= (+ |ULTIMATE.start_main_~nondetString~0#1.offset| 10) .cse2) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post3#1.base|) (+ (- 1) .cse2 |ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset| (+ 9 |ULTIMATE.start_main_~nondetString~0#1.offset|))))) (<= .cse0 .cse1) (<= 9 |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset|))) is different from false [2022-07-12 18:19:55,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:55,111 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-07-12 18:19:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-12 18:19:55,112 INFO L78 Accepts]: Start accepts. Automaton has has 99 states, 98 states have (on average 2.673469387755102) internal successors, (262), 99 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2022-07-12 18:19:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:55,112 INFO L225 Difference]: With dead ends: 101 [2022-07-12 18:19:55,112 INFO L226 Difference]: Without dead ends: 101 [2022-07-12 18:19:55,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4067 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1894, Invalid=18100, Unknown=40, NotChecked=846, Total=20880 [2022-07-12 18:19:55,113 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 95 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 889 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:55,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 691 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 629 Invalid, 0 Unknown, 889 Unchecked, 0.3s Time] [2022-07-12 18:19:55,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-12 18:19:55,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2022-07-12 18:19:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 99 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:55,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2022-07-12 18:19:55,115 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 90 [2022-07-12 18:19:55,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:55,116 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2022-07-12 18:19:55,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 99 states, 98 states have (on average 2.673469387755102) internal successors, (262), 99 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:55,116 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2022-07-12 18:19:55,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-12 18:19:55,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:55,116 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:55,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-07-12 18:19:55,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-12 18:19:55,335 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:19:55,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:55,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1142707534, now seen corresponding path program 8 times [2022-07-12 18:19:55,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:55,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607019578] [2022-07-12 18:19:55,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:55,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 120 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:55,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:55,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607019578] [2022-07-12 18:19:55,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607019578] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:55,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052112869] [2022-07-12 18:19:55,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:19:55,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:55,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:55,774 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-12 18:19:55,775 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-12 18:19:55,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:19:55,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:19:55,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-12 18:19:55,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:55,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:19:55,950 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-12 18:19:55,952 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-12 18:19:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 153 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:56,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:57,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052112869] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:57,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:57,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 74 [2022-07-12 18:19:57,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85725461] [2022-07-12 18:19:57,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:57,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-12 18:19:57,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:57,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-12 18:19:57,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=581, Invalid=4969, Unknown=0, NotChecked=0, Total=5550 [2022-07-12 18:19:57,977 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand has 75 states, 74 states have (on average 3.581081081081081) internal successors, (265), 75 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:59,833 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-07-12 18:19:59,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-12 18:19:59,834 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 3.581081081081081) internal successors, (265), 75 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-07-12 18:19:59,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:59,835 INFO L225 Difference]: With dead ends: 100 [2022-07-12 18:19:59,835 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 18:19:59,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2373 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2047, Invalid=9509, Unknown=0, NotChecked=0, Total=11556 [2022-07-12 18:19:59,837 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 401 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:59,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 571 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 18:19:59,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 18:19:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-12 18:19:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.030612244897959) internal successors, (101), 99 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:59,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2022-07-12 18:19:59,839 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 91 [2022-07-12 18:19:59,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:59,839 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2022-07-12 18:19:59,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 3.581081081081081) internal successors, (265), 75 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:59,840 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-07-12 18:19:59,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-12 18:19:59,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:59,840 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:59,857 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-12 18:20:00,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-12 18:20:00,041 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:20:00,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:20:00,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2009926970, now seen corresponding path program 9 times [2022-07-12 18:20:00,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:20:00,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905324585] [2022-07-12 18:20:00,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:20:00,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:20:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:20:00,407 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 221 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:00,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:20:00,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905324585] [2022-07-12 18:20:00,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905324585] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:20:00,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167426370] [2022-07-12 18:20:00,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:20:00,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:20:00,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:20:00,409 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-12 18:20:00,410 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-12 18:20:01,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-07-12 18:20:01,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:20:01,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-12 18:20:01,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:20:01,607 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:20:01,608 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-12 18:20:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 242 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:02,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:20:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 242 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:03,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167426370] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:20:03,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:20:03,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 27] total 67 [2022-07-12 18:20:03,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087720610] [2022-07-12 18:20:03,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:20:03,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-12 18:20:03,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:20:03,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-12 18:20:03,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=759, Invalid=3663, Unknown=0, NotChecked=0, Total=4422 [2022-07-12 18:20:03,086 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 67 states, 67 states have (on average 3.4477611940298507) internal successors, (231), 67 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:20:03,650 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2022-07-12 18:20:03,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 18:20:03,651 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 3.4477611940298507) internal successors, (231), 67 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-07-12 18:20:03,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:20:03,651 INFO L225 Difference]: With dead ends: 155 [2022-07-12 18:20:03,651 INFO L226 Difference]: Without dead ends: 107 [2022-07-12 18:20:03,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1313, Invalid=5329, Unknown=0, NotChecked=0, Total=6642 [2022-07-12 18:20:03,652 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 83 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:20:03,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 182 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:20:03,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-12 18:20:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2022-07-12 18:20:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 103 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2022-07-12 18:20:03,654 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 95 [2022-07-12 18:20:03,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:20:03,654 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2022-07-12 18:20:03,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 3.4477611940298507) internal successors, (231), 67 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:03,654 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-07-12 18:20:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-12 18:20:03,655 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:20:03,655 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:20:03,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-07-12 18:20:03,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-07-12 18:20:03,866 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:20:03,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:20:03,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2008413431, now seen corresponding path program 10 times [2022-07-12 18:20:03,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:20:03,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991508208] [2022-07-12 18:20:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:20:03,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:20:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:20:04,316 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 153 proven. 331 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:04,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:20:04,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991508208] [2022-07-12 18:20:04,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991508208] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:20:04,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601678726] [2022-07-12 18:20:04,316 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:20:04,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:20:04,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:20:04,318 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-12 18:20:04,320 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-12 18:20:04,478 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:20:04,479 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:20:04,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 194 conjunts are in the unsatisfiable core [2022-07-12 18:20:04,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:20:04,499 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:20:04,499 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-12 18:20:04,504 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-12 18:20:05,515 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-07-12 18:20:05,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:20:06,634 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2022-07-12 18:20:06,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601678726] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:20:06,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:20:06,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18, 18] total 62 [2022-07-12 18:20:06,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556942586] [2022-07-12 18:20:06,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:20:06,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-12 18:20:06,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:20:06,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-12 18:20:06,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=3470, Unknown=0, NotChecked=0, Total=3906 [2022-07-12 18:20:06,636 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand has 63 states, 62 states have (on average 3.370967741935484) internal successors, (209), 63 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:12,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:20:12,801 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-07-12 18:20:12,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-07-12 18:20:12,801 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 3.370967741935484) internal successors, (209), 63 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-07-12 18:20:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:20:12,802 INFO L225 Difference]: With dead ends: 160 [2022-07-12 18:20:12,802 INFO L226 Difference]: Without dead ends: 160 [2022-07-12 18:20:12,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3372 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=3021, Invalid=14009, Unknown=0, NotChecked=0, Total=17030 [2022-07-12 18:20:12,803 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 404 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 2158 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 18:20:12,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 665 Invalid, 2318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2158 Invalid, 0 Unknown, 2 Unchecked, 0.9s Time] [2022-07-12 18:20:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-12 18:20:12,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 149. [2022-07-12 18:20:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 1.0952380952380953) internal successors, (161), 148 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2022-07-12 18:20:12,805 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 99 [2022-07-12 18:20:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:20:12,805 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2022-07-12 18:20:12,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 3.370967741935484) internal successors, (209), 63 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-07-12 18:20:12,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-12 18:20:12,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:20:12,806 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:20:12,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-07-12 18:20:13,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:20:13,024 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:20:13,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:20:13,024 INFO L85 PathProgramCache]: Analyzing trace with hash 544873332, now seen corresponding path program 17 times [2022-07-12 18:20:13,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:20:13,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688420594] [2022-07-12 18:20:13,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:20:13,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:20:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:20:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 24 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:14,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:20:14,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688420594] [2022-07-12 18:20:14,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688420594] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:20:14,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023219903] [2022-07-12 18:20:14,397 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:20:14,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:20:14,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:20:14,398 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-12 18:20:14,400 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-12 18:20:15,339 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2022-07-12 18:20:15,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:20:15,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 205 conjunts are in the unsatisfiable core [2022-07-12 18:20:15,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:20:15,353 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-12 18:20:15,956 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-12 18:20:16,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:20:16,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:16,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:16,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:16,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:16,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:16,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:16,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:16,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:16,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:16,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:16,722 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-12 18:20:16,724 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 24 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:16,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:20:16,732 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-12 18:20:16,736 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,740 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1989 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1989) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-12 18:20:16,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,748 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1988 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1988) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1987) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,768 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1986) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,777 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,781 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1985 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1985) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,789 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1984 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1984) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1983 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1983) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,802 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,807 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1982 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1982) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,815 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1981 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1981) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,819 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,824 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1980 (Array Int Int)) (v_ArrVal_1990 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_1980) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:16,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 11)) 0)) is different from false [2022-07-12 18:20:16,836 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:20:16,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:20:16,840 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:20:16,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:20:16,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:20:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 24 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 263 not checked. [2022-07-12 18:20:17,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023219903] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:20:17,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:20:17,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 42, 42] total 104 [2022-07-12 18:20:17,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960451418] [2022-07-12 18:20:17,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:20:17,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-07-12 18:20:17,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:20:17,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-07-12 18:20:17,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=6261, Unknown=23, NotChecked=4140, Total=10712 [2022-07-12 18:20:17,320 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 104 states, 104 states have (on average 2.230769230769231) internal successors, (232), 104 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:20:20,508 INFO L93 Difference]: Finished difference Result 206 states and 218 transitions. [2022-07-12 18:20:20,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-12 18:20:20,508 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 2.230769230769231) internal successors, (232), 104 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2022-07-12 18:20:20,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:20:20,509 INFO L225 Difference]: With dead ends: 206 [2022-07-12 18:20:20,509 INFO L226 Difference]: Without dead ends: 156 [2022-07-12 18:20:20,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 144 SyntacticMatches, 41 SemanticMatches, 125 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 3275 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=427, Invalid=10354, Unknown=23, NotChecked=5198, Total=16002 [2022-07-12 18:20:20,510 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 50 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 2639 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 4747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2062 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 18:20:20,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 1289 Invalid, 4747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2639 Invalid, 0 Unknown, 2062 Unchecked, 0.9s Time] [2022-07-12 18:20:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-12 18:20:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2022-07-12 18:20:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 151 states have (on average 1.0927152317880795) internal successors, (165), 152 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2022-07-12 18:20:20,513 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 102 [2022-07-12 18:20:20,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:20:20,514 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2022-07-12 18:20:20,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 2.230769230769231) internal successors, (232), 104 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:20,514 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2022-07-12 18:20:20,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 18:20:20,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:20:20,515 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:20:20,536 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-12 18:20:20,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:20:20,715 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:20:20,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:20:20,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1957085649, now seen corresponding path program 18 times [2022-07-12 18:20:20,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:20:20,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360529436] [2022-07-12 18:20:20,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:20:20,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:20:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:20:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 190 proven. 374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:21,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:20:21,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360529436] [2022-07-12 18:20:21,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360529436] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:20:21,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873362211] [2022-07-12 18:20:21,161 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:20:21,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:20:21,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:20:21,162 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-12 18:20:21,163 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-12 18:20:24,283 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-07-12 18:20:24,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:20:24,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 111 conjunts are in the unsatisfiable core [2022-07-12 18:20:24,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:20:24,316 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:20:24,317 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-12 18:20:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 231 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:25,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:20:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 564 backedges. 276 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:26,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873362211] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:20:26,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:20:26,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 85 [2022-07-12 18:20:26,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396634749] [2022-07-12 18:20:26,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:20:26,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-12 18:20:26,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:20:26,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-12 18:20:26,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=834, Invalid=6476, Unknown=0, NotChecked=0, Total=7310 [2022-07-12 18:20:26,875 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand has 86 states, 85 states have (on average 3.6470588235294117) internal successors, (310), 86 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:29,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:20:29,233 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-07-12 18:20:29,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-12 18:20:29,233 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 85 states have (on average 3.6470588235294117) internal successors, (310), 86 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-12 18:20:29,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:20:29,234 INFO L225 Difference]: With dead ends: 153 [2022-07-12 18:20:29,234 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 18:20:29,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2845 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3022, Invalid=12478, Unknown=0, NotChecked=0, Total=15500 [2022-07-12 18:20:29,235 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 463 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:20:29,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 474 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 18:20:29,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 18:20:29,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-07-12 18:20:29,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 151 states have (on average 1.086092715231788) internal successors, (164), 152 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:29,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2022-07-12 18:20:29,237 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 106 [2022-07-12 18:20:29,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:20:29,237 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2022-07-12 18:20:29,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 85 states have (on average 3.6470588235294117) internal successors, (310), 86 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:29,238 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2022-07-12 18:20:29,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-12 18:20:29,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:20:29,238 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:20:29,259 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-12 18:20:29,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:20:29,447 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:20:29,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:20:29,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1557815385, now seen corresponding path program 19 times [2022-07-12 18:20:29,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:20:29,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943215438] [2022-07-12 18:20:29,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:20:29,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:20:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:20:30,968 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 26 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:30,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:20:30,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943215438] [2022-07-12 18:20:30,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943215438] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:20:30,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938559425] [2022-07-12 18:20:30,969 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 18:20:30,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:20:30,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:20:30,970 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-12 18:20:30,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-12 18:20:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:20:31,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 220 conjunts are in the unsatisfiable core [2022-07-12 18:20:31,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:20:31,172 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-12 18:20:31,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:20:32,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:32,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:32,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:32,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:32,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:32,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:32,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:32,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-12 18:20:32,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:32,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:32,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:32,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 14 treesize of output 16 [2022-07-12 18:20:32,770 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-12 18:20:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 26 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:32,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:20:32,783 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-12 18:20:32,789 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,795 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2231 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2231) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-12 18:20:32,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,807 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2230 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2230) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,813 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,819 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2229 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2229) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-12 18:20:32,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2228 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2228) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,837 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,843 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2227 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2227) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,849 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2226 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2226) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,862 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2225 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2225) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2224) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2223 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2223) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,897 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,902 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2222 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2222) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,907 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2221 (Array Int Int)) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2221) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,922 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,926 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2232) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:32,929 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:20:32,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:20:32,934 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:20:32,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:20:32,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:20:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 26 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 311 not checked. [2022-07-12 18:20:33,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938559425] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:20:33,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:20:33,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 45, 45] total 112 [2022-07-12 18:20:33,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412035235] [2022-07-12 18:20:33,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:20:33,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-07-12 18:20:33,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:20:33,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-07-12 18:20:33,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=7247, Unknown=25, NotChecked=4850, Total=12432 [2022-07-12 18:20:33,527 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand has 112 states, 112 states have (on average 2.2410714285714284) internal successors, (251), 112 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:37,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:20:37,293 INFO L93 Difference]: Finished difference Result 214 states and 225 transitions. [2022-07-12 18:20:37,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-07-12 18:20:37,293 INFO L78 Accepts]: Start accepts. Automaton has has 112 states, 112 states have (on average 2.2410714285714284) internal successors, (251), 112 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-07-12 18:20:37,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:20:37,294 INFO L225 Difference]: With dead ends: 214 [2022-07-12 18:20:37,294 INFO L226 Difference]: Without dead ends: 160 [2022-07-12 18:20:37,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 154 SyntacticMatches, 39 SemanticMatches, 136 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 3693 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=464, Invalid=12267, Unknown=25, NotChecked=6150, Total=18906 [2022-07-12 18:20:37,295 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 56 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 4114 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 6839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 4114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2670 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:20:37,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1607 Invalid, 6839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 4114 Invalid, 0 Unknown, 2670 Unchecked, 1.4s Time] [2022-07-12 18:20:37,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-12 18:20:37,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2022-07-12 18:20:37,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.0838709677419356) internal successors, (168), 156 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2022-07-12 18:20:37,297 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 110 [2022-07-12 18:20:37,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:20:37,297 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2022-07-12 18:20:37,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 2.2410714285714284) internal successors, (251), 112 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-07-12 18:20:37,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 18:20:37,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:20:37,297 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:20:37,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-12 18:20:37,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-07-12 18:20:37,511 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:20:37,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:20:37,512 INFO L85 PathProgramCache]: Analyzing trace with hash 31283638, now seen corresponding path program 20 times [2022-07-12 18:20:37,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:20:37,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527290905] [2022-07-12 18:20:37,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:20:37,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:20:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:20:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 231 proven. 432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:38,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:20:38,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527290905] [2022-07-12 18:20:38,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527290905] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:20:38,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63172579] [2022-07-12 18:20:38,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:20:38,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:20:38,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:20:38,049 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:20:38,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-12 18:20:38,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:20:38,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:20:38,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-12 18:20:38,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:20:38,237 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:20:38,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:20:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 276 proven. 387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:39,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:20:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 325 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:40,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63172579] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:20:40,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:20:40,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 92 [2022-07-12 18:20:40,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651820673] [2022-07-12 18:20:40,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:20:40,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2022-07-12 18:20:40,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:20:40,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2022-07-12 18:20:40,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=970, Invalid=7586, Unknown=0, NotChecked=0, Total=8556 [2022-07-12 18:20:40,794 INFO L87 Difference]: Start difference. First operand 157 states and 168 transitions. Second operand has 93 states, 92 states have (on average 3.630434782608696) internal successors, (334), 93 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:42,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:20:42,276 INFO L93 Difference]: Finished difference Result 157 states and 167 transitions. [2022-07-12 18:20:42,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-12 18:20:42,276 INFO L78 Accepts]: Start accepts. Automaton has has 93 states, 92 states have (on average 3.630434782608696) internal successors, (334), 93 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-07-12 18:20:42,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:20:42,277 INFO L225 Difference]: With dead ends: 157 [2022-07-12 18:20:42,277 INFO L226 Difference]: Without dead ends: 157 [2022-07-12 18:20:42,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4180 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2618, Invalid=12388, Unknown=0, NotChecked=0, Total=15006 [2022-07-12 18:20:42,278 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 243 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 2063 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 2142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 18:20:42,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 668 Invalid, 2142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2063 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 18:20:42,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-12 18:20:42,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-07-12 18:20:42,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 155 states have (on average 1.0774193548387097) internal successors, (167), 156 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:42,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2022-07-12 18:20:42,280 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 114 [2022-07-12 18:20:42,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:20:42,281 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2022-07-12 18:20:42,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 92 states have (on average 3.630434782608696) internal successors, (334), 93 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:42,281 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2022-07-12 18:20:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 18:20:42,281 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:20:42,281 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:20:42,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-07-12 18:20:42,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:20:42,503 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:20:42,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:20:42,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1148682818, now seen corresponding path program 21 times [2022-07-12 18:20:42,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:20:42,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374993878] [2022-07-12 18:20:42,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:20:42,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:20:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:20:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 28 proven. 689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:44,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:20:44,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374993878] [2022-07-12 18:20:44,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374993878] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:20:44,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281418885] [2022-07-12 18:20:44,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:20:44,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:20:44,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:20:44,161 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:20:44,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-12 18:20:49,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-07-12 18:20:49,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:20:49,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 307 conjunts are in the unsatisfiable core [2022-07-12 18:20:49,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:20:49,316 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-12 18:20:50,281 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-12 18:20:50,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:50,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:50,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:51,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:51,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:51,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:51,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:51,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:51,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:52,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-12 18:20:52,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:52,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:52,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:20:52,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:20:52,726 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:20:52,726 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-12 18:20:52,729 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 28 proven. 689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:52,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:20:52,736 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-12 18:20:52,741 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2490 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2490) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,755 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2489 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2489) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,771 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2488 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2488) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,777 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,782 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2487 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2487) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,787 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,792 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2486 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2486) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,802 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2485 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2485) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,815 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,820 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2484 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2484) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,837 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2483 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2483) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2482 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2482) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,858 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2481 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2481) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,864 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,869 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2480 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2480) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,885 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2479 (Array Int Int)) (v_ArrVal_2491 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2479) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,890 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,895 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2491 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2491) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 13 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:52,898 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:20:52,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:20:52,903 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:20:52,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:20:52,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:20:53,981 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 28 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 363 not checked. [2022-07-12 18:20:53,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281418885] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:20:53,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:20:53,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 48, 48] total 149 [2022-07-12 18:20:53,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739257694] [2022-07-12 18:20:53,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:20:53,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 149 states [2022-07-12 18:20:53,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:20:53,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2022-07-12 18:20:53,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=14391, Unknown=27, NotChecked=7182, Total=22052 [2022-07-12 18:20:53,983 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand has 149 states, 149 states have (on average 2.248322147651007) internal successors, (335), 149 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:20:57,951 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2022-07-12 18:20:57,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-07-12 18:20:57,952 INFO L78 Accepts]: Start accepts. Automaton has has 149 states, 149 states have (on average 2.248322147651007) internal successors, (335), 149 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-07-12 18:20:57,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:20:57,952 INFO L225 Difference]: With dead ends: 222 [2022-07-12 18:20:57,952 INFO L226 Difference]: Without dead ends: 164 [2022-07-12 18:20:57,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 148 SyntacticMatches, 13 SemanticMatches, 187 ConstructedPredicates, 27 IntricatePredicates, 13 DeprecatedPredicates, 7961 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=736, Invalid=25427, Unknown=27, NotChecked=9342, Total=35532 [2022-07-12 18:20:57,954 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 56 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 4943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2591 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 18:20:57,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 2094 Invalid, 4943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2335 Invalid, 0 Unknown, 2591 Unchecked, 0.8s Time] [2022-07-12 18:20:57,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-12 18:20:57,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2022-07-12 18:20:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 159 states have (on average 1.0754716981132075) internal successors, (171), 160 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:57,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2022-07-12 18:20:57,956 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 118 [2022-07-12 18:20:57,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:20:57,956 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2022-07-12 18:20:57,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 149 states, 149 states have (on average 2.248322147651007) internal successors, (335), 149 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:57,956 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2022-07-12 18:20:57,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-12 18:20:57,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:20:57,957 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:20:57,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-07-12 18:20:58,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:20:58,157 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:20:58,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:20:58,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1419851237, now seen corresponding path program 22 times [2022-07-12 18:20:58,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:20:58,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084417075] [2022-07-12 18:20:58,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:20:58,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:20:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:20:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 276 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:58,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:20:58,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084417075] [2022-07-12 18:20:58,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084417075] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:20:58,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355687049] [2022-07-12 18:20:58,717 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:20:58,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:20:58,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:20:58,718 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:20:58,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-07-12 18:20:58,915 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:20:58,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:20:58,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 232 conjunts are in the unsatisfiable core [2022-07-12 18:20:58,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:20:58,929 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-12 18:20:58,932 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-12 18:20:59,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-12 18:20:59,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:21:00,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:21:00,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:21:00,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:21:00,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:21:00,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 18 treesize of output 20 [2022-07-12 18:21:00,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:21:00,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:21:00,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:21:01,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:21:01,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:21:01,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:21:01,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:21:01,640 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:21:01,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 18:21:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 338 proven. 432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:21:01,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:21:04,652 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2635 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549| Int)) (or (<= (+ 15 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549| |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2635) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 13 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|)) 0))) is different from false [2022-07-12 18:21:04,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2635 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549| Int)) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|)) (<= (+ 15 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 13 |v_ULTIMATE.start_cstrcpy_#t~post3#1.offset_549|)) 0))) is different from false [2022-07-12 18:21:04,667 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:21:04,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:21:04,672 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:21:04,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:21:04,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:21:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 378 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-07-12 18:21:07,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355687049] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:21:07,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:21:07,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 49, 49] total 129 [2022-07-12 18:21:07,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457771303] [2022-07-12 18:21:07,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:21:07,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2022-07-12 18:21:07,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:21:07,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2022-07-12 18:21:07,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1501, Invalid=14748, Unknown=15, NotChecked=506, Total=16770 [2022-07-12 18:21:07,275 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand has 130 states, 129 states have (on average 2.7751937984496124) internal successors, (358), 130 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:21:13,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:21:13,154 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2022-07-12 18:21:13,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-07-12 18:21:13,155 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 129 states have (on average 2.7751937984496124) internal successors, (358), 130 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-07-12 18:21:13,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:21:13,156 INFO L225 Difference]: With dead ends: 161 [2022-07-12 18:21:13,156 INFO L226 Difference]: Without dead ends: 161 [2022-07-12 18:21:13,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 152 SyntacticMatches, 7 SemanticMatches, 178 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5672 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=4517, Invalid=26886, Unknown=111, NotChecked=706, Total=32220 [2022-07-12 18:21:13,157 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 373 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 2195 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 3778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 2195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1231 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 18:21:13,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1092 Invalid, 3778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 2195 Invalid, 0 Unknown, 1231 Unchecked, 0.9s Time] [2022-07-12 18:21:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-12 18:21:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-07-12 18:21:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 159 states have (on average 1.0628930817610063) internal successors, (169), 160 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:21:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 169 transitions. [2022-07-12 18:21:13,159 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 169 transitions. Word has length 122 [2022-07-12 18:21:13,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:21:13,159 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 169 transitions. [2022-07-12 18:21:13,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 129 states have (on average 2.7751937984496124) internal successors, (358), 130 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:21:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 169 transitions. [2022-07-12 18:21:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 18:21:13,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:21:13,160 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:21:13,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-07-12 18:21:13,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-07-12 18:21:13,376 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:21:13,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:21:13,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1417438933, now seen corresponding path program 23 times [2022-07-12 18:21:13,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:21:13,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284898660] [2022-07-12 18:21:13,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:21:13,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:21:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:21:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 468 proven. 422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:21:13,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:21:13,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284898660] [2022-07-12 18:21:13,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284898660] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:21:13,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441358019] [2022-07-12 18:21:13,903 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:21:13,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:21:13,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:21:13,905 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:21:13,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-07-12 18:21:29,161 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2022-07-12 18:21:29,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:21:29,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 125 conjunts are in the unsatisfiable core [2022-07-12 18:21:29,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:21:29,211 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:21:29,212 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-12 18:21:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 497 proven. 393 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:21:30,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:21:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 890 backedges. 497 proven. 393 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:21:31,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441358019] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:21:31,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:21:31,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 86 [2022-07-12 18:21:31,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514127802] [2022-07-12 18:21:31,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:21:31,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-12 18:21:31,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:21:31,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-12 18:21:31,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1168, Invalid=6142, Unknown=0, NotChecked=0, Total=7310 [2022-07-12 18:21:31,411 INFO L87 Difference]: Start difference. First operand 161 states and 169 transitions. Second operand has 86 states, 86 states have (on average 3.6511627906976742) internal successors, (314), 86 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:21:32,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:21:32,781 INFO L93 Difference]: Finished difference Result 232 states and 240 transitions. [2022-07-12 18:21:32,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-12 18:21:32,782 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 3.6511627906976742) internal successors, (314), 86 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-07-12 18:21:32,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:21:32,783 INFO L225 Difference]: With dead ends: 232 [2022-07-12 18:21:32,783 INFO L226 Difference]: Without dead ends: 168 [2022-07-12 18:21:32,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2504, Invalid=11538, Unknown=0, NotChecked=0, Total=14042 [2022-07-12 18:21:32,784 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 151 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:21:32,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 279 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:21:32,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-12 18:21:32,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2022-07-12 18:21:32,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 163 states have (on average 1.0613496932515338) internal successors, (173), 164 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:21:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 173 transitions. [2022-07-12 18:21:32,786 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 173 transitions. Word has length 130 [2022-07-12 18:21:32,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:21:32,786 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 173 transitions. [2022-07-12 18:21:32,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 3.6511627906976742) internal successors, (314), 86 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:21:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 173 transitions. [2022-07-12 18:21:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 18:21:32,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:21:32,787 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:21:32,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-07-12 18:21:33,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-07-12 18:21:33,011 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:21:33,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:21:33,012 INFO L85 PathProgramCache]: Analyzing trace with hash 367084040, now seen corresponding path program 24 times [2022-07-12 18:21:33,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:21:33,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149249323] [2022-07-12 18:21:33,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:21:33,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:21:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:21:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 32 proven. 915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:21:35,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:21:35,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149249323] [2022-07-12 18:21:35,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149249323] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:21:35,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888278498] [2022-07-12 18:21:35,093 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:21:35,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:21:35,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:21:35,094 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:21:35,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-07-12 18:21:53,684 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2022-07-12 18:21:53,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:21:53,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 301 conjunts are in the unsatisfiable core [2022-07-12 18:21:53,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:21:53,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 18:21:54,884 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-12 18:21:55,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:21:55,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:55,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:21:55,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:55,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:21:56,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:56,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:56,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:56,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:21:56,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:21:56,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:57,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:57,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:57,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:57,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:21:57,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:21:57,789 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:21:57,789 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-12 18:21:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 32 proven. 915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:21:57,792 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:21:57,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) is different from false [2022-07-12 18:21:57,816 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,820 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2927) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,830 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2926 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2926) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,835 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,840 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2925 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2925) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,845 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,850 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2924 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2924) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,860 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2923 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2923) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,870 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2922 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2922) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-12 18:21:57,876 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,881 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2921 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2921) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,891 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,901 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2919 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2919) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,906 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,912 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2918 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2918) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,922 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2917 (Array Int Int)) (v_ArrVal_2928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2917) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,928 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,933 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2916) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,939 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,944 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2915 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,949 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) is different from false [2022-07-12 18:21:57,954 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_2914) |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,959 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 15 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2928 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2928) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 15 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:57,968 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:21:57,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:21:57,973 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:21:57,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:21:57,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:21:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 32 proven. 436 refuted. 0 times theorem prover too weak. 0 trivial. 479 not checked. [2022-07-12 18:21:59,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888278498] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:21:59,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:21:59,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 54, 54] total 169 [2022-07-12 18:21:59,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440697944] [2022-07-12 18:21:59,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:21:59,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 169 states [2022-07-12 18:21:59,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:21:59,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2022-07-12 18:21:59,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=18487, Unknown=31, NotChecked=9362, Total=28392 [2022-07-12 18:21:59,282 INFO L87 Difference]: Start difference. First operand 165 states and 173 transitions. Second operand has 169 states, 169 states have (on average 2.2662721893491122) internal successors, (383), 169 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)