./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b6873ae1a0d665798beb3dd9c0c48e89806da7dd46f1d2066800a52e0a2aa51 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 05:39:24,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 05:39:24,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 05:39:24,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 05:39:24,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 05:39:24,867 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 05:39:24,869 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 05:39:24,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 05:39:24,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 05:39:24,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 05:39:24,876 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 05:39:24,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 05:39:24,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 05:39:24,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 05:39:24,880 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 05:39:24,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 05:39:24,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 05:39:24,885 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 05:39:24,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 05:39:24,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 05:39:24,893 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 05:39:24,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 05:39:24,894 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 05:39:24,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 05:39:24,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 05:39:24,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 05:39:24,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 05:39:24,902 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 05:39:24,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 05:39:24,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 05:39:24,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 05:39:24,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 05:39:24,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 05:39:24,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 05:39:24,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 05:39:24,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 05:39:24,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 05:39:24,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 05:39:24,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 05:39:24,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 05:39:24,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 05:39:24,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 05:39:24,912 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 05:39:24,934 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 05:39:24,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 05:39:24,935 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 05:39:24,935 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 05:39:24,936 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 05:39:24,936 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 05:39:24,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 05:39:24,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 05:39:24,937 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 05:39:24,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 05:39:24,938 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 05:39:24,938 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 05:39:24,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 05:39:24,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 05:39:24,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 05:39:24,938 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 05:39:24,939 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 05:39:24,939 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 05:39:24,939 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 05:39:24,939 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 05:39:24,939 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 05:39:24,939 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 05:39:24,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 05:39:24,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 05:39:24,940 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 05:39:24,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:39:24,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 05:39:24,940 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 05:39:24,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 05:39:24,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 05:39:24,941 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 -> 4b6873ae1a0d665798beb3dd9c0c48e89806da7dd46f1d2066800a52e0a2aa51 [2022-07-23 05:39:25,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 05:39:25,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 05:39:25,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 05:39:25,181 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 05:39:25,182 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 05:39:25,183 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i [2022-07-23 05:39:25,241 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce01e1f56/7b20704d79554eaaae1031ddd2ce3fd7/FLAG7c70da8b7 [2022-07-23 05:39:25,675 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 05:39:25,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i [2022-07-23 05:39:25,689 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce01e1f56/7b20704d79554eaaae1031ddd2ce3fd7/FLAG7c70da8b7 [2022-07-23 05:39:25,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce01e1f56/7b20704d79554eaaae1031ddd2ce3fd7 [2022-07-23 05:39:25,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 05:39:25,705 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 05:39:25,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 05:39:25,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 05:39:25,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 05:39:25,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:39:25" (1/1) ... [2022-07-23 05:39:25,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f9de900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:25, skipping insertion in model container [2022-07-23 05:39:25,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:39:25" (1/1) ... [2022-07-23 05:39:25,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 05:39:25,751 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:39:26,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:39:26,034 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 05:39:26,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:39:26,072 INFO L208 MainTranslator]: Completed translation [2022-07-23 05:39:26,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:26 WrapperNode [2022-07-23 05:39:26,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 05:39:26,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 05:39:26,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 05:39:26,075 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 05:39:26,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:26" (1/1) ... [2022-07-23 05:39:26,094 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:26" (1/1) ... [2022-07-23 05:39:26,108 INFO L137 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-07-23 05:39:26,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 05:39:26,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 05:39:26,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 05:39:26,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 05:39:26,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:26" (1/1) ... [2022-07-23 05:39:26,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:26" (1/1) ... [2022-07-23 05:39:26,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:26" (1/1) ... [2022-07-23 05:39:26,120 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:26" (1/1) ... [2022-07-23 05:39:26,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:26" (1/1) ... [2022-07-23 05:39:26,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:26" (1/1) ... [2022-07-23 05:39:26,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:26" (1/1) ... [2022-07-23 05:39:26,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 05:39:26,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 05:39:26,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 05:39:26,134 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 05:39:26,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:26" (1/1) ... [2022-07-23 05:39:26,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:39:26,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:26,188 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-23 05:39:26,194 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-23 05:39:26,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 05:39:26,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 05:39:26,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 05:39:26,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 05:39:26,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 05:39:26,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 05:39:26,287 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 05:39:26,288 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 05:39:26,413 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 05:39:26,417 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 05:39:26,417 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 05:39:26,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:39:26 BoogieIcfgContainer [2022-07-23 05:39:26,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 05:39:26,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 05:39:26,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 05:39:26,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 05:39:26,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 05:39:25" (1/3) ... [2022-07-23 05:39:26,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2d9143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:39:26, skipping insertion in model container [2022-07-23 05:39:26,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:26" (2/3) ... [2022-07-23 05:39:26,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2d9143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:39:26, skipping insertion in model container [2022-07-23 05:39:26,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:39:26" (3/3) ... [2022-07-23 05:39:26,423 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca-2.i [2022-07-23 05:39:26,432 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 05:39:26,432 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-07-23 05:39:26,486 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 05:39:26,490 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@7d4c0cc4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@efae503 [2022-07-23 05:39:26,499 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-07-23 05:39:26,503 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-23 05:39:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 05:39:26,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:26,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 05:39:26,509 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-23 05:39:26,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:26,516 INFO L85 PathProgramCache]: Analyzing trace with hash 889510840, now seen corresponding path program 1 times [2022-07-23 05:39:26,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:26,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363258962] [2022-07-23 05:39:26,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:26,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:26,677 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-23 05:39:26,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:26,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363258962] [2022-07-23 05:39:26,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363258962] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:26,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:26,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:39:26,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809839411] [2022-07-23 05:39:26,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:26,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:39:26,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:26,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:39:26,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:39:26,716 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-23 05:39:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:26,775 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-07-23 05:39:26,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:39:26,777 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-23 05:39:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:26,782 INFO L225 Difference]: With dead ends: 34 [2022-07-23 05:39:26,783 INFO L226 Difference]: Without dead ends: 30 [2022-07-23 05:39:26,784 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-23 05:39:26,788 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-23 05:39:26,791 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-23 05:39:26,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-23 05:39:26,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-07-23 05:39:26,811 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-23 05:39:26,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-23 05:39:26,813 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2022-07-23 05:39:26,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:26,814 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-23 05:39:26,814 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-23 05:39:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-23 05:39:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 05:39:26,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:26,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 05:39:26,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 05:39:26,816 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-23 05:39:26,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:26,818 INFO L85 PathProgramCache]: Analyzing trace with hash 889512762, now seen corresponding path program 1 times [2022-07-23 05:39:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:26,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471109690] [2022-07-23 05:39:26,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:26,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:26,864 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-23 05:39:26,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:26,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471109690] [2022-07-23 05:39:26,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471109690] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:26,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:26,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:39:26,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606319084] [2022-07-23 05:39:26,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:26,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:39:26,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:26,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:39:26,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:39:26,869 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-23 05:39:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:26,887 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-07-23 05:39:26,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:39:26,887 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-23 05:39:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:26,888 INFO L225 Difference]: With dead ends: 29 [2022-07-23 05:39:26,889 INFO L226 Difference]: Without dead ends: 28 [2022-07-23 05:39:26,889 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-23 05:39:26,891 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-23 05:39:26,893 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-23 05:39:26,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-23 05:39:26,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-23 05:39:26,896 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-23 05:39:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-23 05:39:26,897 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2022-07-23 05:39:26,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:26,898 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-23 05:39:26,898 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-23 05:39:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-23 05:39:26,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:39:26,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:26,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:26,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 05:39:26,899 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-23 05:39:26,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:26,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033015, now seen corresponding path program 1 times [2022-07-23 05:39:26,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:26,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616320060] [2022-07-23 05:39:26,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:26,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:26,967 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-23 05:39:26,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:26,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616320060] [2022-07-23 05:39:26,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616320060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:26,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:26,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:39:26,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395497057] [2022-07-23 05:39:26,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:26,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:39:26,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:26,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:39:26,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:39:26,969 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-23 05:39:27,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:27,000 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-07-23 05:39:27,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:39:27,001 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-23 05:39:27,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:27,002 INFO L225 Difference]: With dead ends: 25 [2022-07-23 05:39:27,002 INFO L226 Difference]: Without dead ends: 25 [2022-07-23 05:39:27,002 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-23 05:39:27,003 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-23 05:39:27,003 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-23 05:39:27,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-23 05:39:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-23 05:39:27,005 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-23 05:39:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-07-23 05:39:27,006 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2022-07-23 05:39:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:27,006 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-07-23 05:39:27,006 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-23 05:39:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-07-23 05:39:27,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:39:27,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:27,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:27,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 05:39:27,008 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-23 05:39:27,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:27,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033016, now seen corresponding path program 1 times [2022-07-23 05:39:27,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:27,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409642947] [2022-07-23 05:39:27,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:27,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:27,083 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-23 05:39:27,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:27,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409642947] [2022-07-23 05:39:27,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409642947] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:27,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:27,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:39:27,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118896265] [2022-07-23 05:39:27,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:27,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:39:27,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:27,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:39:27,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:39:27,085 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-23 05:39:27,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:27,116 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-07-23 05:39:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:39:27,117 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-23 05:39:27,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:27,118 INFO L225 Difference]: With dead ends: 24 [2022-07-23 05:39:27,118 INFO L226 Difference]: Without dead ends: 24 [2022-07-23 05:39:27,118 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-23 05:39:27,119 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-23 05:39:27,119 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-23 05:39:27,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-23 05:39:27,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-23 05:39:27,121 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-23 05:39:27,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-23 05:39:27,121 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2022-07-23 05:39:27,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:27,122 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-23 05:39:27,122 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-23 05:39:27,122 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-23 05:39:27,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:39:27,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:27,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:27,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 05:39:27,123 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-23 05:39:27,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:27,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033069, now seen corresponding path program 1 times [2022-07-23 05:39:27,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:27,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113477713] [2022-07-23 05:39:27,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:27,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:27,166 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-23 05:39:27,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:27,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113477713] [2022-07-23 05:39:27,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113477713] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:27,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:27,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:39:27,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083225675] [2022-07-23 05:39:27,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:27,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:39:27,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:27,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:39:27,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:39:27,169 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-23 05:39:27,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:27,184 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-07-23 05:39:27,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:39:27,184 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-23 05:39:27,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:27,185 INFO L225 Difference]: With dead ends: 40 [2022-07-23 05:39:27,185 INFO L226 Difference]: Without dead ends: 40 [2022-07-23 05:39:27,186 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-23 05:39:27,186 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-23 05:39:27,188 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-23 05:39:27,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-23 05:39:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2022-07-23 05:39:27,191 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-23 05:39:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-23 05:39:27,192 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 7 [2022-07-23 05:39:27,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:27,192 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-23 05:39:27,192 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-23 05:39:27,193 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-23 05:39:27,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:39:27,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:27,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:27,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 05:39:27,195 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-23 05:39:27,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:27,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1805092651, now seen corresponding path program 1 times [2022-07-23 05:39:27,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:27,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727993484] [2022-07-23 05:39:27,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:27,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:27,244 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-23 05:39:27,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:27,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727993484] [2022-07-23 05:39:27,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727993484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:27,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:27,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:39:27,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793798353] [2022-07-23 05:39:27,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:27,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:39:27,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:27,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:39:27,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:39:27,248 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-23 05:39:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:27,296 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-07-23 05:39:27,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:39:27,297 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-23 05:39:27,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:27,298 INFO L225 Difference]: With dead ends: 44 [2022-07-23 05:39:27,298 INFO L226 Difference]: Without dead ends: 44 [2022-07-23 05:39:27,299 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-23 05:39:27,301 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-23 05:39:27,302 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-23 05:39:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-23 05:39:27,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2022-07-23 05:39:27,308 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-23 05:39:27,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-23 05:39:27,309 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 7 [2022-07-23 05:39:27,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:27,309 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-23 05:39:27,309 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-23 05:39:27,310 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-23 05:39:27,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 05:39:27,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:27,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:27,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 05:39:27,311 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:39:27,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:27,311 INFO L85 PathProgramCache]: Analyzing trace with hash -530059845, now seen corresponding path program 1 times [2022-07-23 05:39:27,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:27,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573857041] [2022-07-23 05:39:27,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:27,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:27,354 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-23 05:39:27,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:27,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573857041] [2022-07-23 05:39:27,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573857041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:27,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:27,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:39:27,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492411102] [2022-07-23 05:39:27,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:27,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:39:27,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:27,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:39:27,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:39:27,357 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:27,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:27,383 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-07-23 05:39:27,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:39:27,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-23 05:39:27,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:27,384 INFO L225 Difference]: With dead ends: 27 [2022-07-23 05:39:27,384 INFO L226 Difference]: Without dead ends: 27 [2022-07-23 05:39:27,384 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-23 05:39:27,386 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:27,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 28 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:27,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-23 05:39:27,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-23 05:39:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4090909090909092) 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-23 05:39:27,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-23 05:39:27,392 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 9 [2022-07-23 05:39:27,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:27,392 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-23 05:39:27,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:27,393 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-23 05:39:27,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 05:39:27,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:27,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:27,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 05:39:27,393 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:39:27,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:27,394 INFO L85 PathProgramCache]: Analyzing trace with hash -530059844, now seen corresponding path program 1 times [2022-07-23 05:39:27,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:27,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915252413] [2022-07-23 05:39:27,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:27,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:27,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:27,470 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-23 05:39:27,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:27,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915252413] [2022-07-23 05:39:27,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915252413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:27,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:27,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:39:27,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026556009] [2022-07-23 05:39:27,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:27,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:39:27,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:27,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:39:27,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:39:27,473 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:27,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:27,519 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-07-23 05:39:27,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:39:27,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-23 05:39:27,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:27,520 INFO L225 Difference]: With dead ends: 37 [2022-07-23 05:39:27,520 INFO L226 Difference]: Without dead ends: 37 [2022-07-23 05:39:27,520 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-23 05:39:27,521 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 92 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:27,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 36 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:27,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-23 05:39:27,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2022-07-23 05:39:27,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.391304347826087) 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-23 05:39:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-23 05:39:27,526 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 9 [2022-07-23 05:39:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:27,526 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-23 05:39:27,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-23 05:39:27,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 05:39:27,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:27,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:27,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 05:39:27,530 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-23 05:39:27,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:27,530 INFO L85 PathProgramCache]: Analyzing trace with hash 748014006, now seen corresponding path program 1 times [2022-07-23 05:39:27,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:27,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361659843] [2022-07-23 05:39:27,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:27,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:27,621 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-23 05:39:27,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:27,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361659843] [2022-07-23 05:39:27,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361659843] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:27,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:27,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:39:27,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785325862] [2022-07-23 05:39:27,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:27,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:39:27,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:27,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:39:27,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:39:27,623 INFO L87 Difference]: Start difference. First operand 28 states and 32 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-23 05:39:27,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:27,643 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-07-23 05:39:27,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:39:27,644 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-23 05:39:27,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:27,644 INFO L225 Difference]: With dead ends: 27 [2022-07-23 05:39:27,645 INFO L226 Difference]: Without dead ends: 27 [2022-07-23 05:39:27,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:39:27,645 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:27,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 30 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-23 05:39:27,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-23 05:39:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3478260869565217) 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-23 05:39:27,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-23 05:39:27,648 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 10 [2022-07-23 05:39:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:27,648 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-23 05:39:27,648 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-23 05:39:27,648 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-23 05:39:27,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 05:39:27,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:27,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:27,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 05:39:27,649 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-23 05:39:27,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:27,650 INFO L85 PathProgramCache]: Analyzing trace with hash 748014007, now seen corresponding path program 1 times [2022-07-23 05:39:27,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:27,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572224818] [2022-07-23 05:39:27,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:27,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:27,688 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-23 05:39:27,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:27,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572224818] [2022-07-23 05:39:27,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572224818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:27,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:27,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:39:27,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150813071] [2022-07-23 05:39:27,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:27,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:39:27,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:27,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:39:27,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:39:27,691 INFO L87 Difference]: Start difference. First operand 27 states and 31 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-23 05:39:27,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:27,720 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-07-23 05:39:27,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:39:27,720 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-23 05:39:27,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:27,721 INFO L225 Difference]: With dead ends: 34 [2022-07-23 05:39:27,721 INFO L226 Difference]: Without dead ends: 34 [2022-07-23 05:39:27,721 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-23 05:39:27,721 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 56 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:27,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 36 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:27,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-23 05:39:27,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-07-23 05:39:27,723 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-23 05:39:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-23 05:39:27,724 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2022-07-23 05:39:27,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:27,724 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-23 05:39:27,724 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-23 05:39:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-23 05:39:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 05:39:27,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:27,725 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:27,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 05:39:27,725 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-23 05:39:27,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:27,726 INFO L85 PathProgramCache]: Analyzing trace with hash 952918382, now seen corresponding path program 1 times [2022-07-23 05:39:27,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:27,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53422019] [2022-07-23 05:39:27,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:27,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:27,748 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-23 05:39:27,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:27,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53422019] [2022-07-23 05:39:27,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53422019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:27,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:27,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:39:27,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879024039] [2022-07-23 05:39:27,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:27,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:39:27,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:27,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:39:27,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:39:27,751 INFO L87 Difference]: Start difference. First operand 28 states and 32 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-23 05:39:27,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:27,770 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-07-23 05:39:27,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:39:27,770 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-23 05:39:27,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:27,771 INFO L225 Difference]: With dead ends: 47 [2022-07-23 05:39:27,771 INFO L226 Difference]: Without dead ends: 47 [2022-07-23 05:39:27,771 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-23 05:39:27,772 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-23 05:39:27,772 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-23 05:39:27,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-23 05:39:27,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29. [2022-07-23 05:39:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.36) internal successors, (34), 28 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-23 05:39:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-07-23 05:39:27,774 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 11 [2022-07-23 05:39:27,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:27,774 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-07-23 05:39:27,774 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-23 05:39:27,775 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-07-23 05:39:27,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 05:39:27,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:27,775 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:27,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 05:39:27,775 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-23 05:39:27,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:27,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1632976752, now seen corresponding path program 1 times [2022-07-23 05:39:27,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:27,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382893130] [2022-07-23 05:39:27,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:27,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:27,819 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-23 05:39:27,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:27,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382893130] [2022-07-23 05:39:27,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382893130] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:27,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292515156] [2022-07-23 05:39:27,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:27,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:27,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:27,832 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-23 05:39:27,834 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-23 05:39:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:27,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 05:39:27,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:27,944 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:39:27,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, 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-23 05:39:27,986 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-23 05:39:27,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:28,083 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-23 05:39:28,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292515156] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:28,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:28,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-23 05:39:28,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389492021] [2022-07-23 05:39:28,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:28,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 05:39:28,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:28,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 05:39:28,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:39:28,085 INFO L87 Difference]: Start difference. First operand 29 states and 34 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-23 05:39:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:28,176 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-07-23 05:39:28,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:39:28,176 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-23 05:39:28,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:28,177 INFO L225 Difference]: With dead ends: 59 [2022-07-23 05:39:28,177 INFO L226 Difference]: Without dead ends: 59 [2022-07-23 05:39:28,177 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-23 05:39:28,178 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 86 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:28,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 86 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:39:28,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-23 05:39:28,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 26. [2022-07-23 05:39:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 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-23 05:39:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-07-23 05:39:28,180 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 11 [2022-07-23 05:39:28,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:28,180 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-07-23 05:39:28,180 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-23 05:39:28,180 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-07-23 05:39:28,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 05:39:28,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:28,181 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:28,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-23 05:39:28,398 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-23 05:39:28,398 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-23 05:39:28,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:28,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1794944983, now seen corresponding path program 1 times [2022-07-23 05:39:28,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:28,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003598754] [2022-07-23 05:39:28,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:28,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:28,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:28,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003598754] [2022-07-23 05:39:28,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003598754] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:28,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:28,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 05:39:28,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390665514] [2022-07-23 05:39:28,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:28,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:39:28,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:28,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:39:28,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:39:28,477 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:28,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:28,524 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-07-23 05:39:28,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:39:28,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-07-23 05:39:28,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:28,525 INFO L225 Difference]: With dead ends: 37 [2022-07-23 05:39:28,525 INFO L226 Difference]: Without dead ends: 37 [2022-07-23 05:39:28,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 05:39:28,526 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:28,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 81 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:28,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-23 05:39:28,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-07-23 05:39:28,530 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-23 05:39:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-23 05:39:28,532 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 13 [2022-07-23 05:39:28,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:28,532 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-23 05:39:28,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-23 05:39:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 05:39:28,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:28,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:28,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 05:39:28,534 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-23 05:39:28,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:28,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1401917973, now seen corresponding path program 1 times [2022-07-23 05:39:28,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:28,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834691293] [2022-07-23 05:39:28,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:28,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:28,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:28,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834691293] [2022-07-23 05:39:28,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834691293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:28,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:28,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 05:39:28,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589583061] [2022-07-23 05:39:28,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:28,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:39:28,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:28,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:39:28,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:39:28,605 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:28,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:28,663 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-07-23 05:39:28,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:39:28,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-07-23 05:39:28,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:28,664 INFO L225 Difference]: With dead ends: 49 [2022-07-23 05:39:28,664 INFO L226 Difference]: Without dead ends: 49 [2022-07-23 05:39:28,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-23 05:39:28,664 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:28,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 99 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:28,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-23 05:39:28,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2022-07-23 05:39:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.25) internal successors, (35), 30 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-23 05:39:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-07-23 05:39:28,666 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 13 [2022-07-23 05:39:28,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:28,667 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-07-23 05:39:28,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-07-23 05:39:28,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 05:39:28,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:28,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:28,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 05:39:28,668 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-23 05:39:28,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:28,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2102982551, now seen corresponding path program 1 times [2022-07-23 05:39:28,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:28,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330346454] [2022-07-23 05:39:28,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:28,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:28,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:28,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330346454] [2022-07-23 05:39:28,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330346454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:28,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:28,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 05:39:28,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47607279] [2022-07-23 05:39:28,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:28,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:39:28,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:28,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:39:28,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:39:28,767 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:28,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:28,910 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-07-23 05:39:28,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:39:28,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-07-23 05:39:28,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:28,911 INFO L225 Difference]: With dead ends: 44 [2022-07-23 05:39:28,911 INFO L226 Difference]: Without dead ends: 44 [2022-07-23 05:39:28,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-23 05:39:28,911 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:28,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 85 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:28,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-23 05:39:28,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2022-07-23 05:39:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 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-23 05:39:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-07-23 05:39:28,913 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2022-07-23 05:39:28,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:28,914 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-07-23 05:39:28,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:28,914 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-07-23 05:39:28,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-23 05:39:28,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:28,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:28,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 05:39:28,915 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-23 05:39:28,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:28,915 INFO L85 PathProgramCache]: Analyzing trace with hash -191335553, now seen corresponding path program 1 times [2022-07-23 05:39:28,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:28,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867713626] [2022-07-23 05:39:28,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:28,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:28,945 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-23 05:39:28,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:28,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867713626] [2022-07-23 05:39:28,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867713626] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:28,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:28,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:39:28,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689485216] [2022-07-23 05:39:28,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:28,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:39:28,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:28,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:39:28,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:39:28,947 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-23 05:39:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:28,957 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-07-23 05:39:28,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:39:28,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-23 05:39:28,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:28,957 INFO L225 Difference]: With dead ends: 31 [2022-07-23 05:39:28,958 INFO L226 Difference]: Without dead ends: 20 [2022-07-23 05:39:28,958 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-23 05:39:28,958 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 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-23 05:39:28,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:28,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-23 05:39:28,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-23 05:39:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:28,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-07-23 05:39:28,960 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2022-07-23 05:39:28,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:28,960 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-07-23 05:39:28,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 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-23 05:39:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-07-23 05:39:28,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 05:39:28,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:28,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:28,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 05:39:28,961 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-23 05:39:28,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:28,962 INFO L85 PathProgramCache]: Analyzing trace with hash 70337178, now seen corresponding path program 1 times [2022-07-23 05:39:28,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:28,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286049701] [2022-07-23 05:39:28,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:28,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:29,026 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-23 05:39:29,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:29,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286049701] [2022-07-23 05:39:29,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286049701] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:29,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614780561] [2022-07-23 05:39:29,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:29,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:29,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:29,042 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-23 05:39:29,115 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-23 05:39:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:29,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 05:39:29,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:29,243 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-23 05:39:29,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:29,307 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-23 05:39:29,320 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-23 05:39:29,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614780561] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:29,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:29,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-07-23 05:39:29,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317126995] [2022-07-23 05:39:29,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:29,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-23 05:39:29,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:29,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-23 05:39:29,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-07-23 05:39:29,322 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 17 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-23 05:39:29,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:29,418 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-07-23 05:39:29,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 05:39:29,419 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 17 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 17 [2022-07-23 05:39:29,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:29,419 INFO L225 Difference]: With dead ends: 30 [2022-07-23 05:39:29,419 INFO L226 Difference]: Without dead ends: 30 [2022-07-23 05:39:29,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-07-23 05:39:29,420 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 111 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:29,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 45 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:39:29,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-23 05:39:29,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2022-07-23 05:39:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-07-23 05:39:29,422 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2022-07-23 05:39:29,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:29,422 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-07-23 05:39:29,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 17 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-23 05:39:29,422 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-07-23 05:39:29,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 05:39:29,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:29,422 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:29,440 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-23 05:39:29,628 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-23 05:39:29,628 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-23 05:39:29,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash -2114514791, now seen corresponding path program 1 times [2022-07-23 05:39:29,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:29,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409603544] [2022-07-23 05:39:29,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:29,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:29,712 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-23 05:39:29,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:29,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409603544] [2022-07-23 05:39:29,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409603544] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:29,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040269694] [2022-07-23 05:39:29,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:29,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:29,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:29,714 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-23 05:39:29,715 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-23 05:39:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:29,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-23 05:39:29,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:29,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:39:29,779 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-23 05:39:29,783 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-23 05:39:29,874 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-23 05:39:29,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:30,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:30,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040269694] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:30,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:30,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-07-23 05:39:30,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798875244] [2022-07-23 05:39:30,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:30,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-23 05:39:30,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:30,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-23 05:39:30,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-23 05:39:30,022 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:30,147 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-07-23 05:39:30,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 05:39:30,147 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-23 05:39:30,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:30,147 INFO L225 Difference]: With dead ends: 29 [2022-07-23 05:39:30,147 INFO L226 Difference]: Without dead ends: 29 [2022-07-23 05:39:30,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-07-23 05:39:30,148 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 51 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:30,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 48 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:30,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-23 05:39:30,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-07-23 05:39:30,149 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-23 05:39:30,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-23 05:39:30,149 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2022-07-23 05:39:30,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:30,149 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-23 05:39:30,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:30,149 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-23 05:39:30,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-23 05:39:30,150 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:30,150 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:30,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-23 05:39:30,364 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-23 05:39:30,364 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-23 05:39:30,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:30,365 INFO L85 PathProgramCache]: Analyzing trace with hash 775185845, now seen corresponding path program 2 times [2022-07-23 05:39:30,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:30,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435671642] [2022-07-23 05:39:30,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:30,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:30,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:30,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:30,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435671642] [2022-07-23 05:39:30,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435671642] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:30,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665169858] [2022-07-23 05:39:30,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:39:30,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:30,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:30,517 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-23 05:39:30,519 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-23 05:39:30,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:39:30,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:30,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-23 05:39:30,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:30,584 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-23 05:39:30,616 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-23 05:39:30,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:39:30,866 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:30,866 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 18 [2022-07-23 05:39:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:30,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:31,308 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_16| Int) (v_ArrVal_188 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_16|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_16|)) (= (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_~from#1.offset_16| 1)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_16| 3) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)))) is different from false [2022-07-23 05:39:31,331 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:31,331 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-23 05:39:31,340 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:31,340 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-23 05:39:31,354 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-23 05:39:31,358 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-23 05:39:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:31,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665169858] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:31,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:31,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-07-23 05:39:31,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789811772] [2022-07-23 05:39:31,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:31,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-23 05:39:31,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:31,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-23 05:39:31,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=769, Unknown=2, NotChecked=56, Total=930 [2022-07-23 05:39:31,497 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:33,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:33,864 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2022-07-23 05:39:33,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 05:39:33,865 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-23 05:39:33,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:33,865 INFO L225 Difference]: With dead ends: 47 [2022-07-23 05:39:33,865 INFO L226 Difference]: Without dead ends: 38 [2022-07-23 05:39:33,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=202, Invalid=1440, Unknown=2, NotChecked=78, Total=1722 [2022-07-23 05:39:33,866 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:33,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 114 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 67 Unchecked, 0.1s Time] [2022-07-23 05:39:33,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-23 05:39:33,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2022-07-23 05:39:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 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-23 05:39:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-07-23 05:39:33,867 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2022-07-23 05:39:33,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:33,867 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-07-23 05:39:33,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-07-23 05:39:33,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-23 05:39:33,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:33,868 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:33,886 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-23 05:39:34,075 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-23 05:39:34,075 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-23 05:39:34,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:34,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1518290629, now seen corresponding path program 2 times [2022-07-23 05:39:34,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:34,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882186500] [2022-07-23 05:39:34,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:34,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:34,177 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:34,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:34,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882186500] [2022-07-23 05:39:34,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882186500] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:34,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984175718] [2022-07-23 05:39:34,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:39:34,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:34,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:34,204 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-23 05:39:34,243 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-23 05:39:34,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:39:34,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:34,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-23 05:39:34,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:34,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:39:34,306 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-23 05:39:34,309 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-23 05:39:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:34,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:34,719 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:34,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984175718] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:34,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:34,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2022-07-23 05:39:34,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857758294] [2022-07-23 05:39:34,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:34,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-23 05:39:34,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:34,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-23 05:39:34,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-07-23 05:39:34,721 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 21 states, 20 states have (on average 3.45) internal successors, (69), 21 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-23 05:39:34,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:34,987 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-07-23 05:39:34,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 05:39:34,987 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 21 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) Word has length 26 [2022-07-23 05:39:34,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:34,987 INFO L225 Difference]: With dead ends: 34 [2022-07-23 05:39:34,988 INFO L226 Difference]: Without dead ends: 34 [2022-07-23 05:39:34,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2022-07-23 05:39:34,988 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 86 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:34,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 50 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:39:34,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-23 05:39:34,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-07-23 05:39:34,990 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-23 05:39:34,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-07-23 05:39:34,991 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2022-07-23 05:39:34,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:34,991 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-07-23 05:39:34,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 21 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-23 05:39:34,992 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-07-23 05:39:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 05:39:34,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:34,994 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:35,011 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-23 05:39:35,212 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-23 05:39:35,212 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-23 05:39:35,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:35,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1095540269, now seen corresponding path program 3 times [2022-07-23 05:39:35,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:35,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228280804] [2022-07-23 05:39:35,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:35,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:35,389 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:35,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:35,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228280804] [2022-07-23 05:39:35,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228280804] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:35,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935654171] [2022-07-23 05:39:35,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:39:35,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:35,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:35,391 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-23 05:39:35,392 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-23 05:39:35,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-23 05:39:35,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:35,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-23 05:39:35,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:35,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-23 05:39:35,603 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-23 05:39:35,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-23 05:39:35,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:39:35,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:39:35,788 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:35,788 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-23 05:39:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:35,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:35,813 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-23 05:39:35,836 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-23 05:39:35,847 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-23 05:39:35,852 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:35,852 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-23 05:39:35,857 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:35,858 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-23 05:39:35,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:39:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-23 05:39:36,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935654171] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:36,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:36,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 31 [2022-07-23 05:39:36,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668317022] [2022-07-23 05:39:36,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:36,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-23 05:39:36,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:36,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-23 05:39:36,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=668, Unknown=3, NotChecked=162, Total=930 [2022-07-23 05:39:36,036 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 31 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:36,208 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-07-23 05:39:36,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 05:39:36,209 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-23 05:39:36,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:36,209 INFO L225 Difference]: With dead ends: 52 [2022-07-23 05:39:36,209 INFO L226 Difference]: Without dead ends: 39 [2022-07-23 05:39:36,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=872, Unknown=3, NotChecked=186, Total=1190 [2022-07-23 05:39:36,210 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:36,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 166 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2022-07-23 05:39:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-23 05:39:36,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-07-23 05:39:36,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 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-23 05:39:36,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-07-23 05:39:36,211 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 29 [2022-07-23 05:39:36,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:36,211 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-07-23 05:39:36,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-07-23 05:39:36,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 05:39:36,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:36,212 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:36,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-23 05:39:36,412 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-23 05:39:36,413 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-23 05:39:36,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:36,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1267943126, now seen corresponding path program 4 times [2022-07-23 05:39:36,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:36,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430438575] [2022-07-23 05:39:36,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:36,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:36,574 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:36,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:36,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430438575] [2022-07-23 05:39:36,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430438575] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:36,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935362220] [2022-07-23 05:39:36,575 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:39:36,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:36,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:36,576 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-23 05:39:36,577 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-23 05:39:36,637 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:39:36,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:36,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-23 05:39:36,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:36,646 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-23 05:39:36,650 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-23 05:39:36,792 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-23 05:39:36,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:39:36,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:39:36,943 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:36,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-07-23 05:39:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:37,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:37,291 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:37,291 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-23 05:39:37,296 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:37,297 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-23 05:39:37,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:39:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:37,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935362220] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:37,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:37,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 14] total 35 [2022-07-23 05:39:37,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151981222] [2022-07-23 05:39:37,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:37,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-23 05:39:37,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:37,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-23 05:39:37,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1098, Unknown=0, NotChecked=0, Total=1260 [2022-07-23 05:39:37,534 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:38,167 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2022-07-23 05:39:38,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 05:39:38,168 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 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 33 [2022-07-23 05:39:38,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:38,168 INFO L225 Difference]: With dead ends: 48 [2022-07-23 05:39:38,168 INFO L226 Difference]: Without dead ends: 48 [2022-07-23 05:39:38,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=391, Invalid=2057, Unknown=2, NotChecked=0, Total=2450 [2022-07-23 05:39:38,170 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 80 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:38,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 185 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 426 Invalid, 0 Unknown, 101 Unchecked, 0.2s Time] [2022-07-23 05:39:38,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-23 05:39:38,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2022-07-23 05:39:38,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-07-23 05:39:38,171 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 33 [2022-07-23 05:39:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:38,171 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-07-23 05:39:38,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-07-23 05:39:38,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 05:39:38,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:38,172 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:38,193 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-23 05:39:38,379 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-23 05:39:38,379 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-23 05:39:38,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash 651531229, now seen corresponding path program 3 times [2022-07-23 05:39:38,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:38,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322746258] [2022-07-23 05:39:38,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:38,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:38,513 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-23 05:39:38,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:38,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322746258] [2022-07-23 05:39:38,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322746258] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:38,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64025235] [2022-07-23 05:39:38,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:39:38,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:38,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:38,528 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-23 05:39:38,563 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-23 05:39:38,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-23 05:39:38,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:38,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-23 05:39:38,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:38,655 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:39:38,655 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-23 05:39:38,664 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-23 05:39:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:38,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:39,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64025235] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:39,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:39,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2022-07-23 05:39:39,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32810501] [2022-07-23 05:39:39,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:39,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-23 05:39:39,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:39,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-23 05:39:39,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2022-07-23 05:39:39,147 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 28 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 28 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-23 05:39:39,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:39,493 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-07-23 05:39:39,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 05:39:39,494 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 28 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-23 05:39:39,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:39,494 INFO L225 Difference]: With dead ends: 43 [2022-07-23 05:39:39,494 INFO L226 Difference]: Without dead ends: 43 [2022-07-23 05:39:39,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=266, Invalid=1066, Unknown=0, NotChecked=0, Total=1332 [2022-07-23 05:39:39,495 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 135 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:39,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 103 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:39:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-23 05:39:39,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-23 05:39:39,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 42 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:39,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-07-23 05:39:39,496 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 34 [2022-07-23 05:39:39,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:39,496 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-07-23 05:39:39,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 28 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-23 05:39:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-07-23 05:39:39,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 05:39:39,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:39,497 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:39,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-23 05:39:39,697 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-23 05:39:39,697 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:39:39,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:39,698 INFO L85 PathProgramCache]: Analyzing trace with hash -671378910, now seen corresponding path program 4 times [2022-07-23 05:39:39,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:39,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649260736] [2022-07-23 05:39:39,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:39,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:39,821 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:39,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:39,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649260736] [2022-07-23 05:39:39,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649260736] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:39,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584262848] [2022-07-23 05:39:39,822 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:39:39,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:39,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:39,823 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-23 05:39:39,831 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-23 05:39:39,898 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:39:39,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:39,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-23 05:39:39,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:39,911 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:39:39,911 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-23 05:39:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:40,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:40,238 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:40,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584262848] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:40,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:40,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 28 [2022-07-23 05:39:40,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820320940] [2022-07-23 05:39:40,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:40,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-23 05:39:40,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:40,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-23 05:39:40,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2022-07-23 05:39:40,240 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 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-23 05:39:40,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:40,418 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-07-23 05:39:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 05:39:40,419 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 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) Word has length 38 [2022-07-23 05:39:40,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:40,419 INFO L225 Difference]: With dead ends: 69 [2022-07-23 05:39:40,419 INFO L226 Difference]: Without dead ends: 50 [2022-07-23 05:39:40,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=290, Invalid=1042, Unknown=0, NotChecked=0, Total=1332 [2022-07-23 05:39:40,420 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 73 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:40,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 88 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:39:40,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-23 05:39:40,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-07-23 05:39:40,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:40,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-07-23 05:39:40,422 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 38 [2022-07-23 05:39:40,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:40,422 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-07-23 05:39:40,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 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-23 05:39:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-07-23 05:39:40,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 05:39:40,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:40,423 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:40,440 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-23 05:39:40,623 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-23 05:39:40,624 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:39:40,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:40,624 INFO L85 PathProgramCache]: Analyzing trace with hash -452353921, now seen corresponding path program 5 times [2022-07-23 05:39:40,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:40,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156052805] [2022-07-23 05:39:40,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:40,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:40,765 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-23 05:39:40,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:40,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156052805] [2022-07-23 05:39:40,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156052805] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:40,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388020070] [2022-07-23 05:39:40,765 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:39:40,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:40,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:40,767 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-23 05:39:40,788 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-23 05:39:40,872 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-23 05:39:40,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:40,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-23 05:39:40,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:40,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:39:40,888 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-23 05:39:40,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-23 05:39:41,102 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-23 05:39:41,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:41,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388020070] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:41,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:41,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2022-07-23 05:39:41,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696008016] [2022-07-23 05:39:41,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:41,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-23 05:39:41,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:41,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-23 05:39:41,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2022-07-23 05:39:41,321 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 33 states, 32 states have (on average 3.65625) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:41,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:41,565 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-07-23 05:39:41,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 05:39:41,565 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.65625) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-23 05:39:41,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:41,566 INFO L225 Difference]: With dead ends: 50 [2022-07-23 05:39:41,566 INFO L226 Difference]: Without dead ends: 50 [2022-07-23 05:39:41,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=1455, Unknown=0, NotChecked=0, Total=1806 [2022-07-23 05:39:41,566 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 137 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:41,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 135 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:39:41,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-23 05:39:41,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-07-23 05:39:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.065217391304348) internal successors, (49), 47 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-23 05:39:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2022-07-23 05:39:41,568 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 42 [2022-07-23 05:39:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:41,568 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2022-07-23 05:39:41,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.65625) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:41,568 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2022-07-23 05:39:41,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 05:39:41,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:41,568 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:41,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-23 05:39:41,769 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-23 05:39:41,769 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-23 05:39:41,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:41,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1531708431, now seen corresponding path program 5 times [2022-07-23 05:39:41,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:41,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59805437] [2022-07-23 05:39:41,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:41,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 9 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:42,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:42,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59805437] [2022-07-23 05:39:42,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59805437] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:42,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078740147] [2022-07-23 05:39:42,054 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:39:42,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:42,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:42,056 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-23 05:39:42,097 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-23 05:39:42,181 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-23 05:39:42,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:42,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-23 05:39:42,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:42,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-23 05:39:42,352 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-23 05:39:42,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 17 treesize of output 19 [2022-07-23 05:39:42,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:39:42,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:39:42,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:39:42,512 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-23 05:39:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 9 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:42,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:42,522 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_500) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-23 05:39:42,526 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_500) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-23 05:39:42,533 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_500) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-23 05:39:42,541 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_500) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-23 05:39:42,548 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_500) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:39:42,552 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:42,552 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-23 05:39:42,558 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:42,558 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-23 05:39:42,561 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-23 05:39:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 35 not checked. [2022-07-23 05:39:42,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078740147] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:42,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:42,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 33 [2022-07-23 05:39:42,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324929634] [2022-07-23 05:39:42,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:42,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-23 05:39:42,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:42,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-23 05:39:42,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=684, Unknown=5, NotChecked=280, Total=1056 [2022-07-23 05:39:42,749 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 33 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 33 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:43,229 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2022-07-23 05:39:43,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 05:39:43,230 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 33 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-23 05:39:43,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:43,230 INFO L225 Difference]: With dead ends: 76 [2022-07-23 05:39:43,230 INFO L226 Difference]: Without dead ends: 55 [2022-07-23 05:39:43,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=1070, Unknown=5, NotChecked=350, Total=1560 [2022-07-23 05:39:43,231 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:43,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 268 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 465 Invalid, 0 Unknown, 286 Unchecked, 0.3s Time] [2022-07-23 05:39:43,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-23 05:39:43,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2022-07-23 05:39:43,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.06) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2022-07-23 05:39:43,232 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 45 [2022-07-23 05:39:43,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:43,232 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2022-07-23 05:39:43,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 33 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:43,232 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-07-23 05:39:43,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-23 05:39:43,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:43,233 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:43,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-23 05:39:43,433 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-23 05:39:43,433 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-23 05:39:43,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:43,434 INFO L85 PathProgramCache]: Analyzing trace with hash 801080082, now seen corresponding path program 6 times [2022-07-23 05:39:43,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:43,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959021992] [2022-07-23 05:39:43,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:43,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:43,587 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:43,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:43,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959021992] [2022-07-23 05:39:43,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959021992] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:43,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039858961] [2022-07-23 05:39:43,587 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:39:43,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:43,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:43,589 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-23 05:39:43,590 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-23 05:39:43,684 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-23 05:39:43,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:43,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-23 05:39:43,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:43,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:44,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-23 05:39:44,169 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:44,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039858961] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:44,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:44,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 35 [2022-07-23 05:39:44,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308821741] [2022-07-23 05:39:44,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:44,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-23 05:39:44,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:44,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-23 05:39:44,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2022-07-23 05:39:44,170 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 36 states, 35 states have (on average 3.342857142857143) internal successors, (117), 36 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:44,569 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-07-23 05:39:44,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 05:39:44,569 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.342857142857143) internal successors, (117), 36 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-07-23 05:39:44,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:44,570 INFO L225 Difference]: With dead ends: 59 [2022-07-23 05:39:44,570 INFO L226 Difference]: Without dead ends: 59 [2022-07-23 05:39:44,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=443, Invalid=1813, Unknown=0, NotChecked=0, Total=2256 [2022-07-23 05:39:44,571 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 245 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:44,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 182 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:39:44,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-23 05:39:44,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2022-07-23 05:39:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:44,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-07-23 05:39:44,572 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 49 [2022-07-23 05:39:44,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:44,574 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-07-23 05:39:44,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.342857142857143) internal successors, (117), 36 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:44,574 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-07-23 05:39:44,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-23 05:39:44,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:44,574 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:44,592 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-23 05:39:44,783 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-23 05:39:44,784 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:39:44,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:44,784 INFO L85 PathProgramCache]: Analyzing trace with hash -936321247, now seen corresponding path program 6 times [2022-07-23 05:39:44,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:44,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657261224] [2022-07-23 05:39:44,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:44,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:44,925 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-23 05:39:44,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:44,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657261224] [2022-07-23 05:39:44,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657261224] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:44,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411321548] [2022-07-23 05:39:44,926 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:39:44,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:44,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:44,940 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-23 05:39:44,941 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-23 05:39:45,054 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-23 05:39:45,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:45,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-23 05:39:45,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:45,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:39:45,069 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-23 05:39:45,071 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-23 05:39:45,418 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-23 05:39:45,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 45 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:45,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411321548] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:45,842 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:45,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 39 [2022-07-23 05:39:45,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46446356] [2022-07-23 05:39:45,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:45,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-23 05:39:45,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:45,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-23 05:39:45,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1335, Unknown=0, NotChecked=0, Total=1560 [2022-07-23 05:39:45,844 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 40 states, 39 states have (on average 3.641025641025641) internal successors, (142), 40 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:46,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:46,345 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-07-23 05:39:46,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 05:39:46,345 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.641025641025641) internal successors, (142), 40 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-23 05:39:46,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:46,346 INFO L225 Difference]: With dead ends: 58 [2022-07-23 05:39:46,346 INFO L226 Difference]: Without dead ends: 58 [2022-07-23 05:39:46,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=532, Invalid=2120, Unknown=0, NotChecked=0, Total=2652 [2022-07-23 05:39:46,347 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 167 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:46,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 158 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:39:46,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-23 05:39:46,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-07-23 05:39:46,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 55 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-23 05:39:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2022-07-23 05:39:46,350 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2022-07-23 05:39:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:46,350 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2022-07-23 05:39:46,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.641025641025641) internal successors, (142), 40 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-07-23 05:39:46,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-23 05:39:46,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:46,350 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:46,368 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-23 05:39:46,559 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-23 05:39:46,559 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-23 05:39:46,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1866312237, now seen corresponding path program 7 times [2022-07-23 05:39:46,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:46,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160926730] [2022-07-23 05:39:46,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:46,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:46,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:46,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160926730] [2022-07-23 05:39:46,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160926730] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:46,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366985106] [2022-07-23 05:39:46,845 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:39:46,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:46,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:46,847 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-23 05:39:46,849 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-23 05:39:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:46,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-23 05:39:46,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:46,945 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-23 05:39:47,144 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-23 05:39:47,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:39:47,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:39:47,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:39:47,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:39:47,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:39:47,288 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-23 05:39:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:47,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:47,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_677) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-23 05:39:47,304 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_677) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-23 05:39:47,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_677) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-23 05:39:47,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_677) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-23 05:39:47,326 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_677) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-23 05:39:47,332 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_677) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:47,335 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:47,336 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-23 05:39:47,339 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:47,342 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-23 05:39:47,345 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-23 05:39:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 11 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 54 not checked. [2022-07-23 05:39:47,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366985106] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:47,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:47,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 37 [2022-07-23 05:39:47,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703710955] [2022-07-23 05:39:47,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:47,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-23 05:39:47,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:47,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-23 05:39:47,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=852, Unknown=6, NotChecked=378, Total=1332 [2022-07-23 05:39:47,526 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 37 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:48,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:48,006 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2022-07-23 05:39:48,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 05:39:48,007 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 37 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-23 05:39:48,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:48,007 INFO L225 Difference]: With dead ends: 88 [2022-07-23 05:39:48,007 INFO L226 Difference]: Without dead ends: 63 [2022-07-23 05:39:48,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 87 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=1351, Unknown=6, NotChecked=474, Total=1980 [2022-07-23 05:39:48,008 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 339 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:48,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 348 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 691 Invalid, 0 Unknown, 339 Unchecked, 0.3s Time] [2022-07-23 05:39:48,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-23 05:39:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2022-07-23 05:39:48,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:48,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-07-23 05:39:48,010 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 53 [2022-07-23 05:39:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:48,010 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-07-23 05:39:48,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 37 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-07-23 05:39:48,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-23 05:39:48,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:48,010 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:48,028 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-23 05:39:48,210 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-23 05:39:48,211 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:39:48,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:48,211 INFO L85 PathProgramCache]: Analyzing trace with hash -795904464, now seen corresponding path program 8 times [2022-07-23 05:39:48,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:48,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608729938] [2022-07-23 05:39:48,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:48,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 28 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:48,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:48,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608729938] [2022-07-23 05:39:48,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608729938] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:48,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558298400] [2022-07-23 05:39:48,414 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:39:48,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:48,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:48,417 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-23 05:39:48,418 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-23 05:39:48,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:39:48,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:48,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-23 05:39:48,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:48,700 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:48,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:48,919 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-23 05:39:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:48,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558298400] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:48,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:48,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 35 [2022-07-23 05:39:48,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217217654] [2022-07-23 05:39:48,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:48,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-23 05:39:48,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:48,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-23 05:39:48,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1095, Unknown=0, NotChecked=0, Total=1260 [2022-07-23 05:39:48,958 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 36 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 36 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:49,343 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2022-07-23 05:39:49,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 05:39:49,344 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 36 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-07-23 05:39:49,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:49,344 INFO L225 Difference]: With dead ends: 67 [2022-07-23 05:39:49,344 INFO L226 Difference]: Without dead ends: 67 [2022-07-23 05:39:49,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=381, Invalid=1599, Unknown=0, NotChecked=0, Total=1980 [2022-07-23 05:39:49,345 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 308 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:49,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 248 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:39:49,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-23 05:39:49,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2022-07-23 05:39:49,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 62 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-23 05:39:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-07-23 05:39:49,347 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 57 [2022-07-23 05:39:49,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:49,347 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-07-23 05:39:49,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 36 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:49,347 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-07-23 05:39:49,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 05:39:49,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:49,347 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:49,365 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-23 05:39:49,548 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-23 05:39:49,548 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-23 05:39:49,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:49,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1096765379, now seen corresponding path program 7 times [2022-07-23 05:39:49,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:49,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172399164] [2022-07-23 05:39:49,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:49,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:49,758 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-23 05:39:49,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:49,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172399164] [2022-07-23 05:39:49,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172399164] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:49,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317717596] [2022-07-23 05:39:49,758 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:39:49,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:49,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:49,760 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-23 05:39:49,807 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-23 05:39:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:49,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-23 05:39:49,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:49,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:39:49,887 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-23 05:39:49,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-23 05:39:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 45 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:50,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 66 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:50,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317717596] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:50,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:50,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 44 [2022-07-23 05:39:50,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615854579] [2022-07-23 05:39:50,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:50,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-23 05:39:50,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:50,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-23 05:39:50,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1730, Unknown=0, NotChecked=0, Total=1980 [2022-07-23 05:39:50,650 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 45 states, 44 states have (on average 3.75) internal successors, (165), 45 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-23 05:39:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:51,222 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2022-07-23 05:39:51,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 05:39:51,222 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.75) internal successors, (165), 45 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) Word has length 58 [2022-07-23 05:39:51,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:51,223 INFO L225 Difference]: With dead ends: 66 [2022-07-23 05:39:51,223 INFO L226 Difference]: Without dead ends: 66 [2022-07-23 05:39:51,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=627, Invalid=2795, Unknown=0, NotChecked=0, Total=3422 [2022-07-23 05:39:51,224 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 285 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:51,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 228 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:39:51,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-23 05:39:51,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-07-23 05:39:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 63 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2022-07-23 05:39:51,225 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 58 [2022-07-23 05:39:51,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:51,225 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2022-07-23 05:39:51,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.75) internal successors, (165), 45 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-23 05:39:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-07-23 05:39:51,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-23 05:39:51,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:51,226 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:51,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-23 05:39:51,435 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-23 05:39:51,435 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-23 05:39:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:51,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1921179211, now seen corresponding path program 9 times [2022-07-23 05:39:51,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:51,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285711741] [2022-07-23 05:39:51,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:51,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 13 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:51,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:51,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285711741] [2022-07-23 05:39:51,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285711741] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:51,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964962011] [2022-07-23 05:39:51,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:39:51,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:51,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:51,773 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-23 05:39:51,774 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-23 05:39:52,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-23 05:39:52,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:52,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-23 05:39:52,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:52,042 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-23 05:39:52,264 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-23 05:39:52,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:39:52,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:39:52,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:39:52,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:39:52,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:39:52,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-23 05:39:52,433 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-23 05:39:52,435 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 13 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:52,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:52,461 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-23 05:39:52,465 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-23 05:39:52,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-23 05:39:52,480 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)))) is different from false [2022-07-23 05:39:52,487 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-23 05:39:52,494 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)))) is different from false [2022-07-23 05:39:52,501 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 6 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:39:52,505 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:52,505 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-23 05:39:52,509 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:52,509 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-23 05:39:52,512 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-23 05:39:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 13 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 77 not checked. [2022-07-23 05:39:52,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964962011] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:52,700 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:52,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 41 [2022-07-23 05:39:52,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537724452] [2022-07-23 05:39:52,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:52,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-23 05:39:52,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:52,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-23 05:39:52,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1038, Unknown=7, NotChecked=490, Total=1640 [2022-07-23 05:39:52,701 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:53,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:53,471 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-07-23 05:39:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-23 05:39:53,472 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-07-23 05:39:53,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:53,473 INFO L225 Difference]: With dead ends: 100 [2022-07-23 05:39:53,473 INFO L226 Difference]: Without dead ends: 71 [2022-07-23 05:39:53,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=258, Invalid=2313, Unknown=7, NotChecked=728, Total=3306 [2022-07-23 05:39:53,476 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 73 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 502 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:53,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 431 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 833 Invalid, 0 Unknown, 502 Unchecked, 0.3s Time] [2022-07-23 05:39:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-23 05:39:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2022-07-23 05:39:53,482 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-23 05:39:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2022-07-23 05:39:53,483 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 61 [2022-07-23 05:39:53,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:53,483 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2022-07-23 05:39:53,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:53,483 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-07-23 05:39:53,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-23 05:39:53,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:53,484 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:53,501 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-23 05:39:53,699 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-23 05:39:53,700 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-23 05:39:53,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:53,700 INFO L85 PathProgramCache]: Analyzing trace with hash 940963662, now seen corresponding path program 10 times [2022-07-23 05:39:53,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:53,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914291212] [2022-07-23 05:39:53,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:53,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:53,964 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 45 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:53,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:53,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914291212] [2022-07-23 05:39:53,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914291212] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:53,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526006281] [2022-07-23 05:39:53,964 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:39:53,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:53,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:53,988 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-23 05:39:53,989 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-23 05:39:54,089 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:39:54,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:54,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-23 05:39:54,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:54,103 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:39:54,103 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-23 05:39:54,108 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-23 05:39:54,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-23 05:39:54,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 05:39:54,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:39:54,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:39:54,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 18 treesize of output 20 [2022-07-23 05:39:54,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:39:54,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:39:54,875 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:54,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-07-23 05:39:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 72 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:54,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:55,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_138| Int) (v_ArrVal_962 (Array Int Int))) (or (<= (+ 8 |v_ULTIMATE.start_cstrcpy_~from#1.offset_138|) (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_962) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 6 |v_ULTIMATE.start_cstrcpy_~from#1.offset_138|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_138|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_138|)))) is different from false [2022-07-23 05:39:55,538 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:55,538 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-23 05:39:55,543 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:55,543 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-23 05:39:55,546 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-23 05:39:56,444 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:56,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526006281] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:56,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:56,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 22] total 60 [2022-07-23 05:39:56,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101506148] [2022-07-23 05:39:56,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:56,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-07-23 05:39:56,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:56,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-07-23 05:39:56,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=3132, Unknown=1, NotChecked=116, Total=3660 [2022-07-23 05:39:56,447 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 61 states, 60 states have (on average 3.1166666666666667) internal successors, (187), 61 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-23 05:39:57,389 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (.cse1 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2))) (and (<= 7 .cse0) (<= 6 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) (or (not (= |c_ULTIMATE.start_cstrcpy_~from#1.offset| (+ .cse0 (- 1)))) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) (<= .cse1 .cse0) (or (forall ((v_ArrVal_962 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_962) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (and (<= (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3) .cse0) (<= 0 .cse1))) (<= |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6))) is different from false [2022-07-23 05:39:57,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:57,610 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-07-23 05:39:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-23 05:39:57,610 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 3.1166666666666667) internal successors, (187), 61 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 65 [2022-07-23 05:39:57,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:57,611 INFO L225 Difference]: With dead ends: 80 [2022-07-23 05:39:57,611 INFO L226 Difference]: Without dead ends: 80 [2022-07-23 05:39:57,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=903, Invalid=5100, Unknown=11, NotChecked=306, Total=6320 [2022-07-23 05:39:57,612 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 132 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 291 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:57,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 371 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 789 Invalid, 0 Unknown, 291 Unchecked, 0.4s Time] [2022-07-23 05:39:57,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-23 05:39:57,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2022-07-23 05:39:57,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:57,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-07-23 05:39:57,613 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 65 [2022-07-23 05:39:57,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:57,614 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-07-23 05:39:57,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 3.1166666666666667) internal successors, (187), 61 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-23 05:39:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-07-23 05:39:57,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-23 05:39:57,614 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:57,614 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:57,636 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-23 05:39:57,814 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-23 05:39:57,815 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-23 05:39:57,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:57,815 INFO L85 PathProgramCache]: Analyzing trace with hash -894897563, now seen corresponding path program 8 times [2022-07-23 05:39:57,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:57,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543937475] [2022-07-23 05:39:57,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:57,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 45 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:58,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:58,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543937475] [2022-07-23 05:39:58,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543937475] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:58,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069867700] [2022-07-23 05:39:58,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:39:58,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:58,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:58,039 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-23 05:39:58,042 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-23 05:39:58,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:39:58,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:58,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-23 05:39:58,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:58,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:39:58,206 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-23 05:39:58,209 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-23 05:39:58,669 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:58,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 91 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:59,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069867700] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:59,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:59,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 50 [2022-07-23 05:39:59,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216978282] [2022-07-23 05:39:59,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:59,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-23 05:39:59,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:59,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-23 05:39:59,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=2238, Unknown=0, NotChecked=0, Total=2550 [2022-07-23 05:39:59,269 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 51 states, 50 states have (on average 3.78) internal successors, (189), 51 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:59,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:59,912 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2022-07-23 05:39:59,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 05:39:59,912 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 3.78) internal successors, (189), 51 states have internal predecessors, (189), 0 states have call successors, (0), 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 66 [2022-07-23 05:39:59,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:59,913 INFO L225 Difference]: With dead ends: 75 [2022-07-23 05:39:59,913 INFO L226 Difference]: Without dead ends: 75 [2022-07-23 05:39:59,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=795, Invalid=3627, Unknown=0, NotChecked=0, Total=4422 [2022-07-23 05:39:59,914 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 283 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:59,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 341 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:39:59,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-23 05:39:59,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-07-23 05:39:59,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 74 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:59,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2022-07-23 05:39:59,915 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 66 [2022-07-23 05:39:59,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:59,915 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2022-07-23 05:39:59,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.78) internal successors, (189), 51 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:59,916 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2022-07-23 05:39:59,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-23 05:39:59,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:59,916 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:59,933 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-23 05:40:00,123 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-23 05:40:00,123 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:40:00,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:00,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1905496918, now seen corresponding path program 9 times [2022-07-23 05:40:00,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:00,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949054147] [2022-07-23 05:40:00,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:00,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 99 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:00,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:00,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949054147] [2022-07-23 05:40:00,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949054147] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:00,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150810830] [2022-07-23 05:40:00,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:40:00,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:00,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:00,342 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-23 05:40:00,343 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-23 05:40:00,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-07-23 05:40:00,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:00,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-23 05:40:00,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:00,678 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:40:00,679 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-23 05:40:01,160 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 128 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:01,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 128 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:01,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150810830] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:01,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:01,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 48 [2022-07-23 05:40:01,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294749080] [2022-07-23 05:40:01,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:01,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-23 05:40:01,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:01,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-23 05:40:01,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1853, Unknown=0, NotChecked=0, Total=2256 [2022-07-23 05:40:01,528 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 48 states, 48 states have (on average 3.5625) internal successors, (171), 48 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-23 05:40:01,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:01,945 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2022-07-23 05:40:01,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 05:40:01,945 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.5625) internal successors, (171), 48 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) Word has length 70 [2022-07-23 05:40:01,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:01,946 INFO L225 Difference]: With dead ends: 117 [2022-07-23 05:40:01,946 INFO L226 Difference]: Without dead ends: 82 [2022-07-23 05:40:01,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=817, Invalid=3343, Unknown=0, NotChecked=0, Total=4160 [2022-07-23 05:40:01,947 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 91 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:01,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 198 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:40:01,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-23 05:40:01,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2022-07-23 05:40:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 78 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-07-23 05:40:01,949 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 70 [2022-07-23 05:40:01,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:01,949 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-07-23 05:40:01,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.5625) internal successors, (171), 48 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-23 05:40:01,950 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-07-23 05:40:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-23 05:40:01,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:01,950 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:01,969 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-23 05:40:02,169 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-23 05:40:02,169 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:40:02,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:02,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1730266887, now seen corresponding path program 10 times [2022-07-23 05:40:02,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:02,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94568685] [2022-07-23 05:40:02,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:02,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:02,412 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-23 05:40:02,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:02,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94568685] [2022-07-23 05:40:02,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94568685] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:02,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860141234] [2022-07-23 05:40:02,412 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:40:02,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:02,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:02,413 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-23 05:40:02,414 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-23 05:40:02,527 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:40:02,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:02,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-23 05:40:02,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:02,541 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:40:02,542 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-23 05:40:02,547 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-23 05:40:03,193 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-23 05:40:03,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:03,868 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-23 05:40:03,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860141234] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:03,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:03,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 45 [2022-07-23 05:40:03,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424998737] [2022-07-23 05:40:03,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:03,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-23 05:40:03,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:03,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-23 05:40:03,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1800, Unknown=0, NotChecked=0, Total=2070 [2022-07-23 05:40:03,872 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 46 states, 45 states have (on average 3.511111111111111) internal successors, (158), 46 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:06,075 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-07-23 05:40:06,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-23 05:40:06,076 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.511111111111111) internal successors, (158), 46 states have internal predecessors, (158), 0 states have call successors, (0), 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-23 05:40:06,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:06,076 INFO L225 Difference]: With dead ends: 120 [2022-07-23 05:40:06,076 INFO L226 Difference]: Without dead ends: 120 [2022-07-23 05:40:06,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1235, Invalid=5245, Unknown=0, NotChecked=0, Total=6480 [2022-07-23 05:40:06,077 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 295 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:06,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 355 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 988 Invalid, 0 Unknown, 2 Unchecked, 0.4s Time] [2022-07-23 05:40:06,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-23 05:40:06,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2022-07-23 05:40:06,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 110 states have (on average 1.1) internal successors, (121), 111 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2022-07-23 05:40:06,079 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 74 [2022-07-23 05:40:06,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:06,079 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2022-07-23 05:40:06,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.511111111111111) internal successors, (158), 46 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:06,079 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2022-07-23 05:40:06,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-23 05:40:06,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:06,080 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:06,102 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-23 05:40:06,291 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-23 05:40:06,291 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:40:06,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:06,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1816661881, now seen corresponding path program 11 times [2022-07-23 05:40:06,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:06,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795050067] [2022-07-23 05:40:06,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:06,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 17 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:06,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:06,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795050067] [2022-07-23 05:40:06,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795050067] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:06,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126900964] [2022-07-23 05:40:06,727 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:40:06,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:06,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:06,728 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-23 05:40:06,729 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-23 05:40:07,040 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-23 05:40:07,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:07,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 102 conjunts are in the unsatisfiable core [2022-07-23 05:40:07,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:07,050 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-23 05:40:07,357 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-23 05:40:07,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:07,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:07,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:07,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:07,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:07,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:07,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 05:40:07,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:07,573 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-23 05:40:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 17 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:07,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:07,583 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-23 05:40:07,587 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-23 05:40:07,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-23 05:40:07,602 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-23 05:40:07,609 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-23 05:40:07,616 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-23 05:40:07,623 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)))) is different from false [2022-07-23 05:40:07,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-23 05:40:07,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1288) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:40:07,642 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:07,642 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-23 05:40:07,647 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:07,647 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-23 05:40:07,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:40:07,902 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 17 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 135 not checked. [2022-07-23 05:40:07,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126900964] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:07,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:07,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 25] total 49 [2022-07-23 05:40:07,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015167235] [2022-07-23 05:40:07,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:07,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-23 05:40:07,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:07,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-23 05:40:07,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1464, Unknown=9, NotChecked=756, Total=2352 [2022-07-23 05:40:07,903 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 49 states, 49 states have (on average 3.204081632653061) internal successors, (157), 49 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:08,508 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2022-07-23 05:40:08,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-23 05:40:08,508 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.204081632653061) internal successors, (157), 49 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-07-23 05:40:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:08,509 INFO L225 Difference]: With dead ends: 156 [2022-07-23 05:40:08,510 INFO L226 Difference]: Without dead ends: 119 [2022-07-23 05:40:08,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 130 SyntacticMatches, 15 SemanticMatches, 58 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=191, Invalid=2386, Unknown=9, NotChecked=954, Total=3540 [2022-07-23 05:40:08,510 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 598 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:08,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 651 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1384 Invalid, 0 Unknown, 598 Unchecked, 0.3s Time] [2022-07-23 05:40:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-23 05:40:08,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2022-07-23 05:40:08,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 1.0964912280701755) internal successors, (125), 115 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:08,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2022-07-23 05:40:08,514 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 77 [2022-07-23 05:40:08,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:08,514 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2022-07-23 05:40:08,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.204081632653061) internal successors, (157), 49 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:08,514 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2022-07-23 05:40:08,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-23 05:40:08,515 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:08,515 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:08,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-07-23 05:40:08,733 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-23 05:40:08,733 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-23 05:40:08,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1542890378, now seen corresponding path program 12 times [2022-07-23 05:40:08,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:08,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906010778] [2022-07-23 05:40:08,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:08,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 91 proven. 215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:09,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:09,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906010778] [2022-07-23 05:40:09,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906010778] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:09,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196214163] [2022-07-23 05:40:09,060 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:40:09,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:09,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:09,062 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-23 05:40:09,103 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-23 05:40:10,087 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-07-23 05:40:10,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:10,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-23 05:40:10,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:10,105 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:40:10,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, 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-23 05:40:10,771 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 120 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:10,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:11,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196214163] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:11,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:11,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 22] total 63 [2022-07-23 05:40:11,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888158454] [2022-07-23 05:40:11,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:11,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-07-23 05:40:11,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:11,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-07-23 05:40:11,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=3489, Unknown=0, NotChecked=0, Total=4032 [2022-07-23 05:40:11,603 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand has 64 states, 63 states have (on average 3.7301587301587302) internal successors, (235), 64 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:12,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:12,528 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2022-07-23 05:40:12,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 05:40:12,528 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 3.7301587301587302) internal successors, (235), 64 states have internal predecessors, (235), 0 states have call successors, (0), 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 81 [2022-07-23 05:40:12,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:12,529 INFO L225 Difference]: With dead ends: 116 [2022-07-23 05:40:12,529 INFO L226 Difference]: Without dead ends: 116 [2022-07-23 05:40:12,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1338, Invalid=5634, Unknown=0, NotChecked=0, Total=6972 [2022-07-23 05:40:12,529 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 371 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:12,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 270 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:40:12,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-23 05:40:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-07-23 05:40:12,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 1.087719298245614) internal successors, (124), 115 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2022-07-23 05:40:12,531 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 81 [2022-07-23 05:40:12,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:12,531 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2022-07-23 05:40:12,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 3.7301587301587302) internal successors, (235), 64 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:12,532 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2022-07-23 05:40:12,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-23 05:40:12,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:12,532 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:12,551 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-23 05:40:12,732 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-23 05:40:12,732 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-23 05:40:12,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:12,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1904201381, now seen corresponding path program 13 times [2022-07-23 05:40:12,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:12,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048277680] [2022-07-23 05:40:12,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:12,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:13,191 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 19 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:13,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:13,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048277680] [2022-07-23 05:40:13,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048277680] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:13,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490427585] [2022-07-23 05:40:13,192 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:40:13,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:13,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:13,193 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-23 05:40:13,194 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-23 05:40:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:13,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-23 05:40:13,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:13,347 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-23 05:40:13,719 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-23 05:40:13,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:13,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:13,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:13,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:13,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:13,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:13,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:13,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:13,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:13,946 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-23 05:40:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 19 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:13,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:13,953 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-23 05:40:13,960 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-23 05:40:13,965 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-23 05:40:13,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-23 05:40:13,985 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-23 05:40:13,990 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-23 05:40:14,016 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) is different from false [2022-07-23 05:40:14,024 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-23 05:40:14,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-23 05:40:14,041 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:40:14,046 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:14,046 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-23 05:40:14,051 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:14,052 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-23 05:40:14,054 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-23 05:40:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 19 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 170 not checked. [2022-07-23 05:40:14,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490427585] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:14,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:14,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27, 27] total 53 [2022-07-23 05:40:14,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075566931] [2022-07-23 05:40:14,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:14,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-23 05:40:14,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:14,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-23 05:40:14,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1704, Unknown=10, NotChecked=910, Total=2756 [2022-07-23 05:40:14,373 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand has 53 states, 53 states have (on average 3.2641509433962264) internal successors, (173), 53 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-23 05:40:15,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:15,466 INFO L93 Difference]: Finished difference Result 164 states and 172 transitions. [2022-07-23 05:40:15,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-23 05:40:15,466 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.2641509433962264) internal successors, (173), 53 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) Word has length 85 [2022-07-23 05:40:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:15,467 INFO L225 Difference]: With dead ends: 164 [2022-07-23 05:40:15,467 INFO L226 Difference]: Without dead ends: 123 [2022-07-23 05:40:15,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 144 SyntacticMatches, 17 SemanticMatches, 63 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=205, Invalid=2795, Unknown=10, NotChecked=1150, Total=4160 [2022-07-23 05:40:15,468 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 39 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 2748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 867 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:15,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 795 Invalid, 2748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1867 Invalid, 0 Unknown, 867 Unchecked, 0.6s Time] [2022-07-23 05:40:15,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-23 05:40:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2022-07-23 05:40:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 118 states have (on average 1.0847457627118644) internal successors, (128), 119 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:15,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2022-07-23 05:40:15,476 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 85 [2022-07-23 05:40:15,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:15,476 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2022-07-23 05:40:15,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.2641509433962264) internal successors, (173), 53 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-23 05:40:15,477 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2022-07-23 05:40:15,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-23 05:40:15,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:15,477 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:15,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-23 05:40:15,693 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-23 05:40:15,694 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:40:15,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:15,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1305948504, now seen corresponding path program 14 times [2022-07-23 05:40:15,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:15,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110519195] [2022-07-23 05:40:15,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:15,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 120 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:15,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:15,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110519195] [2022-07-23 05:40:15,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110519195] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:15,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081449956] [2022-07-23 05:40:15,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:40:15,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:15,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:15,962 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-23 05:40:15,963 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-23 05:40:16,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:40:16,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:16,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-23 05:40:16,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:16,118 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:40:16,119 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-23 05:40:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 153 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:16,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 190 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:17,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081449956] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:17,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:17,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 68 [2022-07-23 05:40:17,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106846035] [2022-07-23 05:40:17,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:17,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-23 05:40:17,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:17,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-23 05:40:17,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=4152, Unknown=0, NotChecked=0, Total=4692 [2022-07-23 05:40:17,645 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand has 69 states, 68 states have (on average 3.7794117647058822) internal successors, (257), 69 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:18,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:18,602 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2022-07-23 05:40:18,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 05:40:18,603 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 3.7794117647058822) internal successors, (257), 69 states have internal predecessors, (257), 0 states have call successors, (0), 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 89 [2022-07-23 05:40:18,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:18,603 INFO L225 Difference]: With dead ends: 120 [2022-07-23 05:40:18,603 INFO L226 Difference]: Without dead ends: 120 [2022-07-23 05:40:18,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1419, Invalid=6771, Unknown=0, NotChecked=0, Total=8190 [2022-07-23 05:40:18,604 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 412 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:18,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 558 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 05:40:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-23 05:40:18,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-23 05:40:18,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 118 states have (on average 1.076271186440678) internal successors, (127), 119 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2022-07-23 05:40:18,606 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 89 [2022-07-23 05:40:18,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:18,606 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2022-07-23 05:40:18,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 3.7794117647058822) internal successors, (257), 69 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:18,607 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2022-07-23 05:40:18,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-23 05:40:18,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:18,607 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:18,626 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-23 05:40:18,814 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-23 05:40:18,814 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:40:18,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:18,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1102366013, now seen corresponding path program 15 times [2022-07-23 05:40:18,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:18,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829685431] [2022-07-23 05:40:18,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:18,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:19,398 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 21 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:19,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:19,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829685431] [2022-07-23 05:40:19,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829685431] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:19,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448036362] [2022-07-23 05:40:19,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:40:19,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:19,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:19,408 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-23 05:40:19,409 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-23 05:40:21,240 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-07-23 05:40:21,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:21,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-23 05:40:21,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:21,255 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-23 05:40:21,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-23 05:40:21,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:21,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:21,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:21,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:21,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:21,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:21,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:21,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:21,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:21,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:21,904 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-23 05:40:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 21 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:21,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:21,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-23 05:40:21,944 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-23 05:40:21,950 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-23 05:40:21,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-23 05:40:21,965 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-23 05:40:21,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-23 05:40:21,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) is different from false [2022-07-23 05:40:21,986 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-23 05:40:21,992 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-23 05:40:22,000 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-23 05:40:22,007 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1685) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 10)) 0)) is different from false [2022-07-23 05:40:22,011 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:22,011 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-23 05:40:22,015 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:22,016 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-23 05:40:22,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:40:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 21 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 209 not checked. [2022-07-23 05:40:22,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448036362] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:22,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:22,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 29] total 57 [2022-07-23 05:40:22,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651196488] [2022-07-23 05:40:22,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:22,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-23 05:40:22,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-23 05:40:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1962, Unknown=11, NotChecked=1078, Total=3192 [2022-07-23 05:40:22,369 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand has 57 states, 57 states have (on average 3.2982456140350878) internal successors, (188), 57 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:23,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:23,549 INFO L93 Difference]: Finished difference Result 172 states and 179 transitions. [2022-07-23 05:40:23,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-23 05:40:23,550 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 3.2982456140350878) internal successors, (188), 57 states have internal predecessors, (188), 0 states have call successors, (0), 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 93 [2022-07-23 05:40:23,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:23,550 INFO L225 Difference]: With dead ends: 172 [2022-07-23 05:40:23,551 INFO L226 Difference]: Without dead ends: 127 [2022-07-23 05:40:23,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 158 SyntacticMatches, 10 SemanticMatches, 79 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=336, Invalid=4527, Unknown=11, NotChecked=1606, Total=6480 [2022-07-23 05:40:23,551 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 103 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1059 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:23,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 842 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1920 Invalid, 0 Unknown, 1059 Unchecked, 0.5s Time] [2022-07-23 05:40:23,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-23 05:40:23,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-07-23 05:40:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 122 states have (on average 1.0737704918032787) internal successors, (131), 123 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2022-07-23 05:40:23,559 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 93 [2022-07-23 05:40:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:23,560 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2022-07-23 05:40:23,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.2982456140350878) internal successors, (188), 57 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2022-07-23 05:40:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-23 05:40:23,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:23,560 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:23,579 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-23 05:40:23,762 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-23 05:40:23,763 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:40:23,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:23,763 INFO L85 PathProgramCache]: Analyzing trace with hash 46237638, now seen corresponding path program 16 times [2022-07-23 05:40:23,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:23,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711371175] [2022-07-23 05:40:23,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:23,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 153 proven. 309 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:24,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:24,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711371175] [2022-07-23 05:40:24,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711371175] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:24,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968320070] [2022-07-23 05:40:24,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:40:24,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:24,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:24,166 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-23 05:40:24,215 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-23 05:40:24,347 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:40:24,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:24,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 118 conjunts are in the unsatisfiable core [2022-07-23 05:40:24,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:24,357 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-23 05:40:24,360 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-23 05:40:24,888 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-23 05:40:24,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:25,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:25,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:25,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:25,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-23 05:40:25,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:25,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:25,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-23 05:40:25,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:25,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:25,596 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:25,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-07-23 05:40:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 200 proven. 262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:25,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:26,636 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_303| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1802) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 10 |v_ULTIMATE.start_cstrcpy_~from#1.offset_303|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_303|) (<= (+ 12 |v_ULTIMATE.start_cstrcpy_~from#1.offset_303|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_303|)))) is different from false [2022-07-23 05:40:26,641 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:26,641 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-23 05:40:26,646 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:26,646 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-23 05:40:26,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:40:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 231 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:28,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968320070] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:28,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:28,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30, 30] total 84 [2022-07-23 05:40:28,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978999187] [2022-07-23 05:40:28,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:28,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-07-23 05:40:28,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:28,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-07-23 05:40:28,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=6188, Unknown=1, NotChecked=164, Total=7140 [2022-07-23 05:40:28,120 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand has 85 states, 84 states have (on average 3.369047619047619) internal successors, (283), 85 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:29,759 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-07-23 05:40:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-23 05:40:29,759 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 84 states have (on average 3.369047619047619) internal successors, (283), 85 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-07-23 05:40:29,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:29,760 INFO L225 Difference]: With dead ends: 124 [2022-07-23 05:40:29,760 INFO L226 Difference]: Without dead ends: 124 [2022-07-23 05:40:29,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 106 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2129 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1668, Invalid=9669, Unknown=9, NotChecked=210, Total=11556 [2022-07-23 05:40:29,761 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 293 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 2031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 555 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:29,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 597 Invalid, 2031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1259 Invalid, 0 Unknown, 555 Unchecked, 0.5s Time] [2022-07-23 05:40:29,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-23 05:40:29,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-23 05:40:29,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 122 states have (on average 1.0573770491803278) internal successors, (129), 123 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:29,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2022-07-23 05:40:29,763 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 97 [2022-07-23 05:40:29,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:29,763 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2022-07-23 05:40:29,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 84 states have (on average 3.369047619047619) internal successors, (283), 85 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:29,763 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2022-07-23 05:40:29,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-23 05:40:29,763 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:29,763 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:29,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-23 05:40:29,964 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-23 05:40:29,964 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-23 05:40:29,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:29,964 INFO L85 PathProgramCache]: Analyzing trace with hash -374809476, now seen corresponding path program 17 times [2022-07-23 05:40:29,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:29,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535318930] [2022-07-23 05:40:29,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:29,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 280 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:30,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:30,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535318930] [2022-07-23 05:40:30,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535318930] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:30,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558892714] [2022-07-23 05:40:30,323 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:40:30,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:30,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:30,329 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-23 05:40:30,330 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-23 05:40:32,167 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2022-07-23 05:40:32,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:32,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-23 05:40:32,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:32,190 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:40:32,191 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-23 05:40:32,974 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 325 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:32,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 325 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:33,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558892714] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:33,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:33,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 68 [2022-07-23 05:40:33,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164762301] [2022-07-23 05:40:33,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:33,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-07-23 05:40:33,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:33,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-07-23 05:40:33,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=3769, Unknown=0, NotChecked=0, Total=4556 [2022-07-23 05:40:33,424 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 68 states, 68 states have (on average 3.735294117647059) internal successors, (254), 68 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:34,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:34,027 INFO L93 Difference]: Finished difference Result 182 states and 187 transitions. [2022-07-23 05:40:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-23 05:40:34,027 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 3.735294117647059) internal successors, (254), 68 states have internal predecessors, (254), 0 states have call successors, (0), 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 105 [2022-07-23 05:40:34,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:34,028 INFO L225 Difference]: With dead ends: 182 [2022-07-23 05:40:34,028 INFO L226 Difference]: Without dead ends: 131 [2022-07-23 05:40:34,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1615, Invalid=6941, Unknown=0, NotChecked=0, Total=8556 [2022-07-23 05:40:34,030 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 122 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:34,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 226 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:40:34,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-23 05:40:34,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2022-07-23 05:40:34,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 126 states have (on average 1.0555555555555556) internal successors, (133), 127 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2022-07-23 05:40:34,034 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 105 [2022-07-23 05:40:34,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:34,035 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2022-07-23 05:40:34,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 3.735294117647059) internal successors, (254), 68 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2022-07-23 05:40:34,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-23 05:40:34,036 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:34,036 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:34,059 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-23 05:40:34,250 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-23 05:40:34,250 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-23 05:40:34,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:34,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1637661951, now seen corresponding path program 18 times [2022-07-23 05:40:34,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:34,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491169065] [2022-07-23 05:40:34,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:34,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 25 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:34,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:34,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491169065] [2022-07-23 05:40:34,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491169065] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:34,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037772398] [2022-07-23 05:40:34,879 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:40:34,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:34,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:34,880 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-23 05:40:34,881 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-23 05:40:36,942 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-07-23 05:40:36,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:36,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-23 05:40:36,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:36,965 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-23 05:40:37,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-23 05:40:37,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:37,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:37,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:37,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:37,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:37,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:37,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:37,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:37,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:37,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:37,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:37,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:37,718 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-23 05:40:37,720 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 25 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:37,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:37,758 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-23 05:40:37,762 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-23 05:40:37,769 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-23 05:40:37,776 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-23 05:40:37,783 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)))) is different from false [2022-07-23 05:40:37,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-23 05:40:37,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) is different from false [2022-07-23 05:40:37,805 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-23 05:40:37,812 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-23 05:40:37,819 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-23 05:40:37,826 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)) 0)) is different from false [2022-07-23 05:40:37,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12)) 0)) is different from false [2022-07-23 05:40:37,840 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2043) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:40:37,844 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:37,844 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-23 05:40:37,848 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:37,848 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-23 05:40:37,850 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-23 05:40:38,250 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 25 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 299 not checked. [2022-07-23 05:40:38,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037772398] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:38,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:38,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 33] total 65 [2022-07-23 05:40:38,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894954448] [2022-07-23 05:40:38,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:38,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-23 05:40:38,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:38,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-23 05:40:38,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2532, Unknown=13, NotChecked=1456, Total=4160 [2022-07-23 05:40:38,252 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand has 65 states, 65 states have (on average 3.3846153846153846) internal successors, (220), 65 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:39,777 INFO L93 Difference]: Finished difference Result 188 states and 193 transitions. [2022-07-23 05:40:39,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-23 05:40:39,777 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.3846153846153846) internal successors, (220), 65 states have internal predecessors, (220), 0 states have call successors, (0), 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 109 [2022-07-23 05:40:39,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:39,778 INFO L225 Difference]: With dead ends: 188 [2022-07-23 05:40:39,778 INFO L226 Difference]: Without dead ends: 135 [2022-07-23 05:40:39,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 188 SyntacticMatches, 21 SemanticMatches, 79 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=261, Invalid=4334, Unknown=13, NotChecked=1872, Total=6480 [2022-07-23 05:40:39,778 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 60 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 2632 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 4090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1440 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:39,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1101 Invalid, 4090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2632 Invalid, 0 Unknown, 1440 Unchecked, 0.9s Time] [2022-07-23 05:40:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-23 05:40:39,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2022-07-23 05:40:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 130 states have (on average 1.0538461538461539) internal successors, (137), 131 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 137 transitions. [2022-07-23 05:40:39,780 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 137 transitions. Word has length 109 [2022-07-23 05:40:39,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:39,780 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 137 transitions. [2022-07-23 05:40:39,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.3846153846153846) internal successors, (220), 65 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2022-07-23 05:40:39,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-23 05:40:39,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:39,781 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:39,803 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-23 05:40:39,981 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-23 05:40:39,981 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-23 05:40:39,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:39,982 INFO L85 PathProgramCache]: Analyzing trace with hash 64398338, now seen corresponding path program 19 times [2022-07-23 05:40:39,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:39,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570359415] [2022-07-23 05:40:39,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:39,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 231 proven. 419 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:40,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:40,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570359415] [2022-07-23 05:40:40,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570359415] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:40,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804602837] [2022-07-23 05:40:40,486 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:40:40,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:40,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:40,488 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-23 05:40:40,490 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-23 05:40:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:40,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-23 05:40:40,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 276 proven. 374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:41,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:41,714 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-23 05:40:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 276 proven. 374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:41,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804602837] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:41,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:41,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 31] total 63 [2022-07-23 05:40:41,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328579003] [2022-07-23 05:40:41,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:41,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-07-23 05:40:41,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:41,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-07-23 05:40:41,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=3538, Unknown=0, NotChecked=0, Total=4032 [2022-07-23 05:40:41,781 INFO L87 Difference]: Start difference. First operand 132 states and 137 transitions. Second operand has 64 states, 63 states have (on average 3.619047619047619) internal successors, (228), 64 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:42,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:42,636 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2022-07-23 05:40:42,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-23 05:40:42,636 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 3.619047619047619) internal successors, (228), 64 states have internal predecessors, (228), 0 states have call successors, (0), 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 113 [2022-07-23 05:40:42,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:42,637 INFO L225 Difference]: With dead ends: 132 [2022-07-23 05:40:42,637 INFO L226 Difference]: Without dead ends: 132 [2022-07-23 05:40:42,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1158, Invalid=5162, Unknown=0, NotChecked=0, Total=6320 [2022-07-23 05:40:42,638 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 408 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:42,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 738 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 05:40:42,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-23 05:40:42,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-23 05:40:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 130 states have (on average 1.0461538461538462) internal successors, (136), 131 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2022-07-23 05:40:42,648 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 113 [2022-07-23 05:40:42,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:42,648 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2022-07-23 05:40:42,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 3.619047619047619) internal successors, (228), 64 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:42,649 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2022-07-23 05:40:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-23 05:40:42,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:42,649 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:42,667 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-23 05:40:42,867 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-23 05:40:42,867 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-23 05:40:42,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:42,868 INFO L85 PathProgramCache]: Analyzing trace with hash 804967197, now seen corresponding path program 20 times [2022-07-23 05:40:42,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:42,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129443463] [2022-07-23 05:40:42,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:42,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:42,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 27 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:43,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:43,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129443463] [2022-07-23 05:40:43,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129443463] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:43,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2242874] [2022-07-23 05:40:43,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:40:43,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:43,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:43,430 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-23 05:40:43,431 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-23 05:40:43,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:40:43,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:43,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 140 conjunts are in the unsatisfiable core [2022-07-23 05:40:43,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:43,622 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-23 05:40:43,626 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-23 05:40:44,196 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-23 05:40:44,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 17 treesize of output 19 [2022-07-23 05:40:44,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:44,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:44,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 17 treesize of output 19 [2022-07-23 05:40:44,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:40:44,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:44,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:45,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:45,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 05:40:45,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:45,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:45,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:45,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:45,648 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:45,649 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 18 [2022-07-23 05:40:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 276 proven. 427 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:45,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:47,167 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2302 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_411| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_411|)) (<= (+ 15 |v_ULTIMATE.start_cstrcpy_~from#1.offset_411|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_411|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2302) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 13 |v_ULTIMATE.start_cstrcpy_~from#1.offset_411|)) 0))) is different from false [2022-07-23 05:40:47,173 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:47,173 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-23 05:40:47,179 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:47,179 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-23 05:40:47,182 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-23 05:40:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 325 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:49,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2242874] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:49,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:49,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35, 35] total 102 [2022-07-23 05:40:49,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342579506] [2022-07-23 05:40:49,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:49,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-07-23 05:40:49,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:49,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-07-23 05:40:49,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=685, Invalid=9416, Unknown=3, NotChecked=198, Total=10302 [2022-07-23 05:40:49,018 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand has 102 states, 102 states have (on average 3.3627450980392157) internal successors, (343), 102 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:51,302 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2022-07-23 05:40:51,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-23 05:40:51,302 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 3.3627450980392157) internal successors, (343), 102 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-07-23 05:40:51,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:51,303 INFO L225 Difference]: With dead ends: 196 [2022-07-23 05:40:51,303 INFO L226 Difference]: Without dead ends: 139 [2022-07-23 05:40:51,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 216 SyntacticMatches, 3 SemanticMatches, 134 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2341 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1331, Invalid=16760, Unknown=3, NotChecked=266, Total=18360 [2022-07-23 05:40:51,304 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 152 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1072 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:51,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1580 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1663 Invalid, 0 Unknown, 1072 Unchecked, 0.5s Time] [2022-07-23 05:40:51,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-23 05:40:51,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2022-07-23 05:40:51,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 134 states have (on average 1.037313432835821) internal successors, (139), 135 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 139 transitions. [2022-07-23 05:40:51,306 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 139 transitions. Word has length 117 [2022-07-23 05:40:51,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:51,306 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 139 transitions. [2022-07-23 05:40:51,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 3.3627450980392157) internal successors, (343), 102 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:51,306 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 139 transitions. [2022-07-23 05:40:51,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-23 05:40:51,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:51,307 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:51,342 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-23 05:40:51,507 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-23 05:40:51,507 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-23 05:40:51,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:51,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1561098043, now seen corresponding path program 21 times [2022-07-23 05:40:51,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:51,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435258701] [2022-07-23 05:40:51,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:51,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:52,334 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 29 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:52,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:52,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435258701] [2022-07-23 05:40:52,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435258701] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:52,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314709668] [2022-07-23 05:40:52,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:40:52,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:52,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:52,348 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-23 05:40:52,363 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-23 05:40:54,751 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-07-23 05:40:54,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:54,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 158 conjunts are in the unsatisfiable core [2022-07-23 05:40:54,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:54,769 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-23 05:40:55,365 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-23 05:40:55,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:55,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:55,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:55,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:55,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:55,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:55,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-23 05:40:55,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:55,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:55,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-23 05:40:55,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:55,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:55,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:55,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-23 05:40:55,723 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-23 05:40:55,726 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 29 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:55,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:55,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-23 05:40:55,740 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-23 05:40:55,749 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-23 05:40:55,758 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-23 05:40:55,769 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-23 05:40:55,777 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-23 05:40:55,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) is different from false [2022-07-23 05:40:55,793 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-23 05:40:55,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-23 05:40:55,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-23 05:40:55,818 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)) 0)) is different from false [2022-07-23 05:40:55,826 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12)) 0)) is different from false [2022-07-23 05:40:55,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 13)) 0)) is different from false [2022-07-23 05:40:55,841 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 14)) 0)) is different from false [2022-07-23 05:40:55,849 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2450) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:40:55,853 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:55,853 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-23 05:40:55,857 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:55,857 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-23 05:40:55,860 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-23 05:40:56,313 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 29 proven. 379 refuted. 0 times theorem prover too weak. 0 trivial. 405 not checked. [2022-07-23 05:40:56,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314709668] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:56,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:56,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37, 37] total 73 [2022-07-23 05:40:56,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985057038] [2022-07-23 05:40:56,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:56,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-07-23 05:40:56,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:56,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-07-23 05:40:56,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3174, Unknown=15, NotChecked=1890, Total=5256 [2022-07-23 05:40:56,316 INFO L87 Difference]: Start difference. First operand 136 states and 139 transitions. Second operand has 73 states, 73 states have (on average 3.4657534246575343) internal successors, (253), 73 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:58,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:58,020 INFO L93 Difference]: Finished difference Result 204 states and 207 transitions. [2022-07-23 05:40:58,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-23 05:40:58,020 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 3.4657534246575343) internal successors, (253), 73 states have internal predecessors, (253), 0 states have call successors, (0), 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 125 [2022-07-23 05:40:58,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:58,021 INFO L225 Difference]: With dead ends: 204 [2022-07-23 05:40:58,021 INFO L226 Difference]: Without dead ends: 143 [2022-07-23 05:40:58,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 219 SyntacticMatches, 22 SemanticMatches, 88 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=275, Invalid=5320, Unknown=15, NotChecked=2400, Total=8010 [2022-07-23 05:40:58,022 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 53 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 3816 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 5803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1967 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:58,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1514 Invalid, 5803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3816 Invalid, 0 Unknown, 1967 Unchecked, 1.0s Time] [2022-07-23 05:40:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-23 05:40:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2022-07-23 05:40:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 138 states have (on average 1.036231884057971) internal successors, (143), 139 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-23 05:40:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2022-07-23 05:40:58,025 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 125 [2022-07-23 05:40:58,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:58,025 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 143 transitions. [2022-07-23 05:40:58,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 3.4657534246575343) internal successors, (253), 73 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2022-07-23 05:40:58,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-23 05:40:58,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:58,026 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:58,047 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-23 05:40:58,239 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-23 05:40:58,239 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-23 05:40:58,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:58,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1500121026, now seen corresponding path program 22 times [2022-07-23 05:40:58,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:58,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615331626] [2022-07-23 05:40:58,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:58,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:58,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 325 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:58,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:58,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615331626] [2022-07-23 05:40:58,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615331626] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:58,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923920666] [2022-07-23 05:40:58,735 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:40:58,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:58,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:58,737 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-23 05:40:58,738 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-23 05:40:58,939 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:40:58,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:58,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 152 conjunts are in the unsatisfiable core [2022-07-23 05:40:58,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:58,950 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-23 05:40:58,953 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-23 05:40:59,756 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-23 05:40:59,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 05:40:59,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 05:40:59,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:59,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:00,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:00,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 05:41:00,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:00,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:00,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:00,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 05:41:00,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 05:41:00,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:00,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 18 treesize of output 20 [2022-07-23 05:41:00,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:00,599 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:41:00,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-07-23 05:41:00,724 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 392 proven. 478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:00,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:41:01,849 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2605 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_472| Int)) (or (<= (+ 16 |v_ULTIMATE.start_cstrcpy_~from#1.offset_472|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_472|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_472|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2605) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrcpy_~from#1.offset_472|)) 0))) is different from false [2022-07-23 05:41:01,854 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:41:01,855 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-23 05:41:01,860 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:41:01,860 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-23 05:41:01,863 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-23 05:41:03,989 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 435 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:03,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923920666] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:41:03,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:41:03,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 38, 38] total 107 [2022-07-23 05:41:03,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540991425] [2022-07-23 05:41:03,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:41:04,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-07-23 05:41:04,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:04,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-07-23 05:41:04,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1166, Invalid=10178, Unknown=2, NotChecked=210, Total=11556 [2022-07-23 05:41:04,008 INFO L87 Difference]: Start difference. First operand 140 states and 143 transitions. Second operand has 108 states, 107 states have (on average 3.542056074766355) internal successors, (379), 108 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:05,454 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) (.cse0 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (.cse1 (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|))) (and (<= 14 |c_ULTIMATE.start_main_~i~0#1|) (<= 13 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) (<= 15 .cse0) (= .cse1 |c_ULTIMATE.start_main_~length2~0#1|) (<= .cse2 .cse0) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (or (forall ((v_ArrVal_2605 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2605) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)))) (and (<= (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4) .cse0) (<= 0 .cse2))) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= (+ 15 |c_ULTIMATE.start_main_~nondetString~0#1.offset|) .cse1) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ .cse0 (- 1))) 0) (<= 16 .cse1) (<= |c_ULTIMATE.start_cstrcpy_~from#1.offset| 13))) is different from false [2022-07-23 05:41:05,456 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) (.cse0 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|))) (and (<= 13 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) (<= 15 .cse0) (<= .cse1 .cse0) (or (forall ((v_ArrVal_2605 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2605) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)))) (and (<= (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4) .cse0) (<= 0 .cse1))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ .cse0 (- 1))) 0) (<= |c_ULTIMATE.start_cstrcpy_~from#1.offset| 13))) is different from false [2022-07-23 05:41:05,516 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (.cse1 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2))) (and (<= |c_ULTIMATE.start_cstrcpy_~from#1.offset| 14) (<= 15 .cse0) (<= 14 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) (or (not (= |c_ULTIMATE.start_cstrcpy_~from#1.offset| (+ .cse0 (- 1)))) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) (<= .cse1 .cse0) (or (and (<= (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3) .cse0) (<= 0 .cse1)) (forall ((v_ArrVal_2605 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2605) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0))))) is different from false [2022-07-23 05:41:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:05,746 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2022-07-23 05:41:05,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-23 05:41:05,747 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 107 states have (on average 3.542056074766355) internal successors, (379), 108 states have internal predecessors, (379), 0 states have call successors, (0), 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 129 [2022-07-23 05:41:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:05,747 INFO L225 Difference]: With dead ends: 142 [2022-07-23 05:41:05,748 INFO L226 Difference]: Without dead ends: 142 [2022-07-23 05:41:05,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 208 SyntacticMatches, 4 SemanticMatches, 134 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3202 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2448, Invalid=14846, Unknown=14, NotChecked=1052, Total=18360 [2022-07-23 05:41:05,749 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 331 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 2171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 381 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:05,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 1027 Invalid, 2171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1540 Invalid, 0 Unknown, 381 Unchecked, 0.5s Time] [2022-07-23 05:41:05,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-23 05:41:05,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2022-07-23 05:41:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 138 states have (on average 1.0217391304347827) internal successors, (141), 139 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2022-07-23 05:41:05,751 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 129 [2022-07-23 05:41:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:05,751 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2022-07-23 05:41:05,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 107 states have (on average 3.542056074766355) internal successors, (379), 108 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-07-23 05:41:05,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-23 05:41:05,752 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:05,752 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:05,771 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-23 05:41:05,970 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-23 05:41:05,970 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-23 05:41:05,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:05,971 INFO L85 PathProgramCache]: Analyzing trace with hash -366914316, now seen corresponding path program 23 times [2022-07-23 05:41:05,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:05,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458986877] [2022-07-23 05:41:05,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:05,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:06,490 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 500 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:06,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:06,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458986877] [2022-07-23 05:41:06,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458986877] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:41:06,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161889162] [2022-07-23 05:41:06,490 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:41:06,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:41:06,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:41:06,491 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-23 05:41:06,492 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-23 05:41:09,137 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-07-23 05:41:09,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:41:09,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-23 05:41:09,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:41:09,169 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:41:09,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-23 05:41:10,071 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-23 05:41:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 561 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:10,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:41:10,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-23 05:41:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 561 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:11,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161889162] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:41:11,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:41:11,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 88 [2022-07-23 05:41:11,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082547381] [2022-07-23 05:41:11,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:41:11,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-07-23 05:41:11,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:11,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-07-23 05:41:11,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=6357, Unknown=0, NotChecked=0, Total=7656 [2022-07-23 05:41:11,503 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand has 88 states, 88 states have (on average 3.7954545454545454) internal successors, (334), 88 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-23 05:41:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:12,774 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2022-07-23 05:41:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-23 05:41:12,774 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 3.7954545454545454) internal successors, (334), 88 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 137 [2022-07-23 05:41:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:12,775 INFO L225 Difference]: With dead ends: 214 [2022-07-23 05:41:12,775 INFO L226 Difference]: Without dead ends: 147 [2022-07-23 05:41:12,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3740 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2685, Invalid=11835, Unknown=0, NotChecked=0, Total=14520 [2022-07-23 05:41:12,776 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 195 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:12,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 263 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 05:41:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-23 05:41:12,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2022-07-23 05:41:12,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 142 states have (on average 1.0211267605633803) internal successors, (145), 143 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:12,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2022-07-23 05:41:12,778 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 137 [2022-07-23 05:41:12,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:12,778 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2022-07-23 05:41:12,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 3.7954545454545454) internal successors, (334), 88 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-23 05:41:12,779 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2022-07-23 05:41:12,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-23 05:41:12,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:12,779 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:12,811 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-23 05:41:13,009 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-23 05:41:13,009 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-23 05:41:13,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:13,010 INFO L85 PathProgramCache]: Analyzing trace with hash -366217, now seen corresponding path program 24 times [2022-07-23 05:41:13,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:13,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057031148] [2022-07-23 05:41:13,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:13,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 33 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:13,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:13,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057031148] [2022-07-23 05:41:13,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057031148] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:41:13,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125833133] [2022-07-23 05:41:13,738 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:41:13,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:41:13,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:41:13,740 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-23 05:41:13,741 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-23 05:41:25,794 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-07-23 05:41:25,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:41:25,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 176 conjunts are in the unsatisfiable core [2022-07-23 05:41:25,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:41:25,828 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-23 05:41:26,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-23 05:41:26,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:26,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:26,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:41:26,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:26,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:26,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:26,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:41:26,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:41:26,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:26,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:26,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:26,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:41:26,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-23 05:41:26,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:26,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:26,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:26,735 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-23 05:41:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 33 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:26,738 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:41:26,787 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-23 05:41:26,791 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-23 05:41:26,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-23 05:41:26,805 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-23 05:41:26,813 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-23 05:41:26,820 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-23 05:41:26,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)))) is different from false [2022-07-23 05:41:26,834 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-23 05:41:26,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-23 05:41:26,849 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-23 05:41:26,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)) 0)) is different from false [2022-07-23 05:41:26,863 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12)) 0)) is different from false [2022-07-23 05:41:26,870 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 13)) 0)) is different from false [2022-07-23 05:41:26,878 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 14)) 0)) is different from false [2022-07-23 05:41:26,885 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 15)) 0)) is different from false [2022-07-23 05:41:26,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 16)) 0)) is different from false [2022-07-23 05:41:26,899 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2915) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:41:26,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:41:26,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, 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-23 05:41:26,908 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:41:26,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-23 05:41:26,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:41:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 33 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 527 not checked. [2022-07-23 05:41:27,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125833133] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:41:27,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:41:27,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 41] total 81 [2022-07-23 05:41:27,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732677414] [2022-07-23 05:41:27,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:41:27,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-07-23 05:41:27,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:27,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-07-23 05:41:27,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3888, Unknown=17, NotChecked=2380, Total=6480 [2022-07-23 05:41:27,479 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand has 81 states, 81 states have (on average 3.506172839506173) internal successors, (284), 81 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:30,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:30,159 INFO L93 Difference]: Finished difference Result 220 states and 221 transitions. [2022-07-23 05:41:30,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-07-23 05:41:30,159 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 3.506172839506173) internal successors, (284), 81 states have internal predecessors, (284), 0 states have call successors, (0), 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 141 [2022-07-23 05:41:30,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:30,160 INFO L225 Difference]: With dead ends: 220 [2022-07-23 05:41:30,160 INFO L226 Difference]: Without dead ends: 151 [2022-07-23 05:41:30,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 247 SyntacticMatches, 26 SemanticMatches, 98 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=303, Invalid=6554, Unknown=17, NotChecked=3026, Total=9900 [2022-07-23 05:41:30,160 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 46 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 4869 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 6575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1686 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:30,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1918 Invalid, 6575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4869 Invalid, 0 Unknown, 1686 Unchecked, 1.6s Time] [2022-07-23 05:41:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-23 05:41:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2022-07-23 05:41:30,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 146 states have (on average 1.0205479452054795) internal successors, (149), 147 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2022-07-23 05:41:30,162 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 141 [2022-07-23 05:41:30,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:30,162 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2022-07-23 05:41:30,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 3.506172839506173) internal successors, (284), 81 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2022-07-23 05:41:30,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-23 05:41:30,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:30,163 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:30,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-07-23 05:41:30,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-07-23 05:41:30,373 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:41:30,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:30,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1570798470, now seen corresponding path program 25 times [2022-07-23 05:41:30,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:30,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932512843] [2022-07-23 05:41:30,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:30,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 435 proven. 687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:31,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:31,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932512843] [2022-07-23 05:41:31,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932512843] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:41:31,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879658213] [2022-07-23 05:41:31,026 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:41:31,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:41:31,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:41:31,028 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:41:31,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-07-23 05:41:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:31,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-23 05:41:31,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:41:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 496 proven. 626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:32,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:41:32,969 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-23 05:41:33,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 496 proven. 626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:33,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879658213] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:41:33,059 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:41:33,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39, 39] total 78 [2022-07-23 05:41:33,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985919197] [2022-07-23 05:41:33,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:41:33,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-07-23 05:41:33,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:33,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-07-23 05:41:33,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=5550, Unknown=0, NotChecked=0, Total=6162 [2022-07-23 05:41:33,060 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand has 79 states, 78 states have (on average 3.7435897435897436) internal successors, (292), 79 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:34,525 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2022-07-23 05:41:34,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-23 05:41:34,525 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 78 states have (on average 3.7435897435897436) internal successors, (292), 79 states have internal predecessors, (292), 0 states have call successors, (0), 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 145 [2022-07-23 05:41:34,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:34,526 INFO L225 Difference]: With dead ends: 155 [2022-07-23 05:41:34,526 INFO L226 Difference]: Without dead ends: 155 [2022-07-23 05:41:34,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 246 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2084 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2382, Invalid=10728, Unknown=0, NotChecked=0, Total=13110 [2022-07-23 05:41:34,527 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 508 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 3061 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 3211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 3061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:34,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1085 Invalid, 3211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 3061 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-23 05:41:34,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-23 05:41:34,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2022-07-23 05:41:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 149 states have (on average 1.0201342281879195) internal successors, (152), 150 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2022-07-23 05:41:34,529 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 145 [2022-07-23 05:41:34,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:34,529 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2022-07-23 05:41:34,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 78 states have (on average 3.7435897435897436) internal successors, (292), 79 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:34,530 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2022-07-23 05:41:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-23 05:41:34,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:34,531 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:34,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-07-23 05:41:34,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:41:34,743 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:41:34,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:34,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1450112327, now seen corresponding path program 11 times [2022-07-23 05:41:34,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:34,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157786409] [2022-07-23 05:41:34,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:34,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 435 proven. 704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:35,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:35,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157786409] [2022-07-23 05:41:35,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157786409] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:41:35,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528297504] [2022-07-23 05:41:35,261 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:41:35,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:41:35,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:41:35,262 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:41:35,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-07-23 05:41:48,448 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-07-23 05:41:48,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:41:48,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-23 05:41:48,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:41:48,483 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-23 05:41:48,485 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-23 05:41:49,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 496 proven. 643 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:49,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:41:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 561 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:51,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528297504] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:41:51,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:41:51,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 109 [2022-07-23 05:41:51,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9026651] [2022-07-23 05:41:51,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:41:51,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 110 states [2022-07-23 05:41:51,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:51,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2022-07-23 05:41:51,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1465, Invalid=10525, Unknown=0, NotChecked=0, Total=11990 [2022-07-23 05:41:51,282 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand has 110 states, 109 states have (on average 3.944954128440367) internal successors, (430), 110 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:52,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:52,643 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2022-07-23 05:41:52,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-23 05:41:52,643 INFO L78 Accepts]: Start accepts. Automaton has has 110 states, 109 states have (on average 3.944954128440367) internal successors, (430), 110 states have internal predecessors, (430), 0 states have call successors, (0), 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 146 [2022-07-23 05:41:52,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:52,644 INFO L225 Difference]: With dead ends: 154 [2022-07-23 05:41:52,644 INFO L226 Difference]: Without dead ends: 154 [2022-07-23 05:41:52,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4501 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2815, Invalid=14215, Unknown=0, NotChecked=0, Total=17030 [2022-07-23 05:41:52,646 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 412 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 3204 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 3339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 3204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:52,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1125 Invalid, 3339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 3204 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-23 05:41:52,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-23 05:41:52,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2022-07-23 05:41:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 150 states have (on average 1.02) internal successors, (153), 151 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2022-07-23 05:41:52,648 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 146 [2022-07-23 05:41:52,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:52,648 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2022-07-23 05:41:52,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 110 states, 109 states have (on average 3.944954128440367) internal successors, (430), 110 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:52,648 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2022-07-23 05:41:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-23 05:41:52,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:52,649 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:52,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-07-23 05:41:52,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:41:52,863 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:41:52,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:52,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1515276395, now seen corresponding path program 26 times [2022-07-23 05:41:52,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:52,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247445944] [2022-07-23 05:41:52,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:52,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 35 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:53,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:53,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247445944] [2022-07-23 05:41:53,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247445944] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:41:53,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409169961] [2022-07-23 05:41:53,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:41:53,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:41:53,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:41:53,816 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:41:53,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-07-23 05:41:54,079 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:41:54,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:41:54,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 170 conjunts are in the unsatisfiable core [2022-07-23 05:41:54,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:41:54,097 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:41:54,097 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-23 05:41:54,104 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-23 05:41:55,264 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-23 05:41:55,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:55,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:41:55,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:41:55,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:55,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:56,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:56,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:56,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:56,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:41:56,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:56,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:56,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:56,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:56,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:57,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-23 05:41:57,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:41:57,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:57,519 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:41:57,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 18 treesize of output 18 [2022-07-23 05:41:57,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 496 proven. 695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:57,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:41:59,934 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3395 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_630| Int)) (or (<= (+ 19 |v_ULTIMATE.start_cstrcpy_~from#1.offset_630|) (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_3395) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 17 |v_ULTIMATE.start_cstrcpy_~from#1.offset_630|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_630|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_630|)))) is different from false [2022-07-23 05:41:59,939 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:41:59,939 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-23 05:41:59,943 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:41:59,943 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-23 05:41:59,945 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-23 05:42:02,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 561 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:02,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409169961] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:02,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:02,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 43, 43] total 126 [2022-07-23 05:42:02,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86077069] [2022-07-23 05:42:02,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:02,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2022-07-23 05:42:02,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:02,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2022-07-23 05:42:02,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1009, Invalid=14492, Unknown=3, NotChecked=246, Total=15750 [2022-07-23 05:42:02,704 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand has 126 states, 126 states have (on average 3.484126984126984) internal successors, (439), 126 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:05,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:05,515 INFO L93 Difference]: Finished difference Result 235 states and 236 transitions. [2022-07-23 05:42:05,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-23 05:42:05,516 INFO L78 Accepts]: Start accepts. Automaton has has 126 states, 126 states have (on average 3.484126984126984) internal successors, (439), 126 states have internal predecessors, (439), 0 states have call successors, (0), 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 149 [2022-07-23 05:42:05,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:05,516 INFO L225 Difference]: With dead ends: 235 [2022-07-23 05:42:05,516 INFO L226 Difference]: Without dead ends: 162 [2022-07-23 05:42:05,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 279 SyntacticMatches, 3 SemanticMatches, 166 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3607 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1937, Invalid=25786, Unknown=3, NotChecked=330, Total=28056 [2022-07-23 05:42:05,526 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 196 mSDsluCounter, 2196 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 2743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 738 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:05,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 2237 Invalid, 2743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1985 Invalid, 0 Unknown, 738 Unchecked, 0.5s Time] [2022-07-23 05:42:05,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-23 05:42:05,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2022-07-23 05:42:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 157 states have (on average 1.019108280254777) internal successors, (160), 158 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2022-07-23 05:42:05,538 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 149 [2022-07-23 05:42:05,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:05,538 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2022-07-23 05:42:05,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 126 states have (on average 3.484126984126984) internal successors, (439), 126 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:05,539 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2022-07-23 05:42:05,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-23 05:42:05,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:05,539 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:05,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-07-23 05:42:05,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-07-23 05:42:05,758 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:42:05,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:05,759 INFO L85 PathProgramCache]: Analyzing trace with hash -349318309, now seen corresponding path program 12 times [2022-07-23 05:42:05,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:05,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346967638] [2022-07-23 05:42:05,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:05,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 496 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:06,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:06,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346967638] [2022-07-23 05:42:06,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346967638] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:06,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042710249] [2022-07-23 05:42:06,518 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:42:06,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:06,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:06,519 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:42:06,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-07-23 05:42:47,002 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-07-23 05:42:47,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:42:47,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-23 05:42:47,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:47,088 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:42:47,089 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-23 05:42:47,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-23 05:42:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 561 proven. 717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:48,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 630 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:50,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042710249] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:50,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:50,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40, 40] total 117 [2022-07-23 05:42:50,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412749446] [2022-07-23 05:42:50,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:50,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2022-07-23 05:42:50,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:50,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2022-07-23 05:42:50,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1778, Invalid=12028, Unknown=0, NotChecked=0, Total=13806 [2022-07-23 05:42:50,463 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand has 118 states, 117 states have (on average 3.8803418803418803) internal successors, (454), 118 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:52,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:52,780 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2022-07-23 05:42:52,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-23 05:42:52,780 INFO L78 Accepts]: Start accepts. Automaton has has 118 states, 117 states have (on average 3.8803418803418803) internal successors, (454), 118 states have internal predecessors, (454), 0 states have call successors, (0), 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 154 [2022-07-23 05:42:52,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:52,781 INFO L225 Difference]: With dead ends: 162 [2022-07-23 05:42:52,781 INFO L226 Difference]: Without dead ends: 162 [2022-07-23 05:42:52,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5387 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4495, Invalid=19997, Unknown=0, NotChecked=0, Total=24492 [2022-07-23 05:42:52,782 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 1129 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 2051 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 2397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 2051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:52,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 710 Invalid, 2397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 2051 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-23 05:42:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-23 05:42:52,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2022-07-23 05:42:52,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 158 states have (on average 1.018987341772152) internal successors, (161), 159 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-23 05:42:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2022-07-23 05:42:52,785 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 154 [2022-07-23 05:42:52,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:52,785 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2022-07-23 05:42:52,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 118 states, 117 states have (on average 3.8803418803418803) internal successors, (454), 118 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:52,786 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-07-23 05:42:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-23 05:42:52,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:52,786 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:52,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-07-23 05:42:53,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-07-23 05:42:53,011 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:42:53,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:53,012 INFO L85 PathProgramCache]: Analyzing trace with hash 164008883, now seen corresponding path program 27 times [2022-07-23 05:42:53,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:53,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962851819] [2022-07-23 05:42:53,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:53,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 37 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:53,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:53,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962851819] [2022-07-23 05:42:53,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962851819] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:53,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664316678] [2022-07-23 05:42:53,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:42:53,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:53,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:53,931 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:42:53,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-07-23 05:43:05,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2022-07-23 05:43:05,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:43:05,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 194 conjunts are in the unsatisfiable core [2022-07-23 05:43:05,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:43:05,542 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-23 05:43:06,292 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-23 05:43:06,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:06,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:06,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:06,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:43:06,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:43:06,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:06,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:06,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:06,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:06,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:06,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:06,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-23 05:43:06,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:06,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:06,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:06,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:43:06,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:06,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:06,597 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-23 05:43:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 37 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:06,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:43:06,606 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-23 05:43:06,609 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-23 05:43:06,614 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-23 05:43:06,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-23 05:43:06,624 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-23 05:43:06,628 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-23 05:43:06,633 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) is different from false [2022-07-23 05:43:06,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-23 05:43:06,643 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-23 05:43:06,648 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-23 05:43:06,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)) 0)) is different from false [2022-07-23 05:43:06,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12)) 0)) is different from false [2022-07-23 05:43:06,688 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 13)) 0)) is different from false [2022-07-23 05:43:06,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 14)) 0)) is different from false [2022-07-23 05:43:06,702 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 15)) 0)) is different from false [2022-07-23 05:43:06,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 16)) 0)) is different from false [2022-07-23 05:43:06,716 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 17)) 0)) is different from false [2022-07-23 05:43:06,723 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 18)))) is different from false [2022-07-23 05:43:06,730 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_3740) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 18 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-23 05:43:06,734 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:43:06,734 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-23 05:43:06,738 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:43:06,738 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-23 05:43:06,740 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-23 05:43:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 37 proven. 631 refuted. 0 times theorem prover too weak. 0 trivial. 665 not checked. [2022-07-23 05:43:07,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664316678] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:43:07,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:43:07,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 45, 45] total 89 [2022-07-23 05:43:07,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188479459] [2022-07-23 05:43:07,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:43:07,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-07-23 05:43:07,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:43:07,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-07-23 05:43:07,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=4674, Unknown=19, NotChecked=2926, Total=7832 [2022-07-23 05:43:07,478 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand has 89 states, 89 states have (on average 3.561797752808989) internal successors, (317), 89 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:10,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:43:10,967 INFO L93 Difference]: Finished difference Result 244 states and 245 transitions. [2022-07-23 05:43:10,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-23 05:43:10,968 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 3.561797752808989) internal successors, (317), 89 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-07-23 05:43:10,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:43:10,968 INFO L225 Difference]: With dead ends: 244 [2022-07-23 05:43:10,968 INFO L226 Difference]: Without dead ends: 167 [2022-07-23 05:43:10,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 273 SyntacticMatches, 31 SemanticMatches, 111 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 1402 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=367, Invalid=8432, Unknown=19, NotChecked=3838, Total=12656 [2022-07-23 05:43:10,969 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 62 mSDsluCounter, 2344 mSDsCounter, 0 mSdLazyCounter, 6229 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 2387 SdHoareTripleChecker+Invalid, 9217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 6229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2962 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:43:10,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 2387 Invalid, 9217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 6229 Invalid, 0 Unknown, 2962 Unchecked, 2.1s Time] [2022-07-23 05:43:10,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-23 05:43:10,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2022-07-23 05:43:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 1.0185185185185186) internal successors, (165), 163 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-23 05:43:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2022-07-23 05:43:10,971 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 157 [2022-07-23 05:43:10,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:43:10,971 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2022-07-23 05:43:10,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 3.561797752808989) internal successors, (317), 89 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:10,971 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2022-07-23 05:43:10,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-23 05:43:10,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:43:10,972 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:43:11,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-07-23 05:43:11,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-07-23 05:43:11,175 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:43:11,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:43:11,175 INFO L85 PathProgramCache]: Analyzing trace with hash 512968886, now seen corresponding path program 28 times [2022-07-23 05:43:11,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:43:11,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949541293] [2022-07-23 05:43:11,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:43:11,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:43:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:43:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 561 proven. 845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:11,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:43:11,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949541293] [2022-07-23 05:43:11,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949541293] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:43:11,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586565244] [2022-07-23 05:43:11,777 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:43:11,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:43:11,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:43:11,778 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:43:11,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-07-23 05:43:12,062 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:43:12,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:43:12,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 184 conjunts are in the unsatisfiable core [2022-07-23 05:43:12,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:43:12,076 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:43:12,077 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-23 05:43:12,080 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-23 05:43:12,854 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-23 05:43:12,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:13,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:13,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 05:43:13,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:13,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 18 treesize of output 20 [2022-07-23 05:43:13,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 18 treesize of output 20 [2022-07-23 05:43:13,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:13,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:13,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:13,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 18 treesize of output 20 [2022-07-23 05:43:13,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:13,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 05:43:13,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:13,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:13,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 05:43:13,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:14,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-23 05:43:14,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:43:14,220 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:43:14,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-07-23 05:43:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 648 proven. 758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:14,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:43:16,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3930 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_726| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_726|)) (<= (+ 20 |v_ULTIMATE.start_cstrcpy_~from#1.offset_726|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_726|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_3930) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 18 |v_ULTIMATE.start_cstrcpy_~from#1.offset_726|)) 0))) is different from false [2022-07-23 05:43:16,552 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:43:16,553 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-23 05:43:16,558 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:43:16,558 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-23 05:43:16,561 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-23 05:43:19,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 703 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:19,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586565244] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:43:19,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:43:19,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 46, 46] total 131 [2022-07-23 05:43:19,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954906918] [2022-07-23 05:43:19,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:43:19,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-07-23 05:43:19,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:43:19,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-07-23 05:43:19,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1728, Invalid=15304, Unknown=2, NotChecked=258, Total=17292 [2022-07-23 05:43:19,564 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand has 132 states, 131 states have (on average 3.6259541984732824) internal successors, (475), 132 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:23,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:43:23,150 INFO L93 Difference]: Finished difference Result 176 states and 177 transitions. [2022-07-23 05:43:23,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-23 05:43:23,151 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 131 states have (on average 3.6259541984732824) internal successors, (475), 132 states have internal predecessors, (475), 0 states have call successors, (0), 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 161 [2022-07-23 05:43:23,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:43:23,151 INFO L225 Difference]: With dead ends: 176 [2022-07-23 05:43:23,151 INFO L226 Difference]: Without dead ends: 176 [2022-07-23 05:43:23,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 248 SyntacticMatches, 3 SemanticMatches, 160 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4823 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=3665, Invalid=22094, Unknown=5, NotChecked=318, Total=26082 [2022-07-23 05:43:23,153 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 431 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 3098 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 5289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 3098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1834 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:43:23,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1579 Invalid, 5289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 3098 Invalid, 0 Unknown, 1834 Unchecked, 1.3s Time] [2022-07-23 05:43:23,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-23 05:43:23,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2022-07-23 05:43:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 1.0236686390532543) internal successors, (173), 170 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-23 05:43:23,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2022-07-23 05:43:23,154 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 161 [2022-07-23 05:43:23,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:43:23,155 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2022-07-23 05:43:23,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 131 states have (on average 3.6259541984732824) internal successors, (475), 132 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:23,155 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2022-07-23 05:43:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-23 05:43:23,155 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:43:23,155 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:43:23,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-07-23 05:43:23,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:43:23,366 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:43:23,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:43:23,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1277833731, now seen corresponding path program 13 times [2022-07-23 05:43:23,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:43:23,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324915333] [2022-07-23 05:43:23,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:43:23,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:43:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:43:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 561 proven. 864 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:24,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:43:24,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324915333] [2022-07-23 05:43:24,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324915333] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:43:24,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401026113] [2022-07-23 05:43:24,035 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:43:24,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:43:24,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:43:24,036 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:43:24,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-07-23 05:43:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:43:24,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 117 conjunts are in the unsatisfiable core [2022-07-23 05:43:24,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:43:24,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:43:24,374 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-23 05:43:24,376 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-23 05:43:26,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 630 proven. 795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:26,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:43:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 703 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:28,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401026113] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:43:28,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:43:28,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 122 [2022-07-23 05:43:28,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365973869] [2022-07-23 05:43:28,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:43:28,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 123 states [2022-07-23 05:43:28,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:43:28,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2022-07-23 05:43:28,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1602, Invalid=13404, Unknown=0, NotChecked=0, Total=15006 [2022-07-23 05:43:28,185 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand has 123 states, 122 states have (on average 3.9098360655737703) internal successors, (477), 123 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:30,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:43:30,424 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2022-07-23 05:43:30,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-23 05:43:30,424 INFO L78 Accepts]: Start accepts. Automaton has has 123 states, 122 states have (on average 3.9098360655737703) internal successors, (477), 123 states have internal predecessors, (477), 0 states have call successors, (0), 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 162 [2022-07-23 05:43:30,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:43:30,425 INFO L225 Difference]: With dead ends: 171 [2022-07-23 05:43:30,425 INFO L226 Difference]: Without dead ends: 171 [2022-07-23 05:43:30,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6362 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4371, Invalid=22035, Unknown=0, NotChecked=0, Total=26406 [2022-07-23 05:43:30,427 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 733 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 3965 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 4201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 3965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:43:30,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1372 Invalid, 4201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 3965 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-23 05:43:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-23 05:43:30,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-23 05:43:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 1.017751479289941) internal successors, (172), 170 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2022-07-23 05:43:30,450 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 162 [2022-07-23 05:43:30,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:43:30,450 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2022-07-23 05:43:30,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 123 states, 122 states have (on average 3.9098360655737703) internal successors, (477), 123 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:30,451 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2022-07-23 05:43:30,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-23 05:43:30,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:43:30,451 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:43:30,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-07-23 05:43:30,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:43:30,671 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:43:30,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:43:30,671 INFO L85 PathProgramCache]: Analyzing trace with hash 403815490, now seen corresponding path program 14 times [2022-07-23 05:43:30,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:43:30,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127269921] [2022-07-23 05:43:30,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:43:30,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:43:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:43:31,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1503 backedges. 723 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:31,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:43:31,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127269921] [2022-07-23 05:43:31,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127269921] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:43:31,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220086288] [2022-07-23 05:43:31,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:43:31,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:43:31,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:43:31,468 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:43:31,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-07-23 05:43:31,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:43:31,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:43:31,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-23 05:43:31,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:43:31,818 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:43:31,819 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-23 05:43:33,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1503 backedges. 800 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:33,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:43:34,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1503 backedges. 780 proven. 723 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:34,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220086288] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:43:34,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:43:34,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 109 [2022-07-23 05:43:34,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168143787] [2022-07-23 05:43:34,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:43:34,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2022-07-23 05:43:34,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:43:34,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2022-07-23 05:43:34,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2153, Invalid=9619, Unknown=0, NotChecked=0, Total=11772 [2022-07-23 05:43:34,984 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand has 109 states, 109 states have (on average 3.7522935779816513) internal successors, (409), 109 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:36,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:43:36,027 INFO L93 Difference]: Finished difference Result 261 states and 262 transitions. [2022-07-23 05:43:36,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-23 05:43:36,028 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 3.7522935779816513) internal successors, (409), 109 states have internal predecessors, (409), 0 states have call successors, (0), 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 166 [2022-07-23 05:43:36,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:43:36,028 INFO L225 Difference]: With dead ends: 261 [2022-07-23 05:43:36,028 INFO L226 Difference]: Without dead ends: 178 [2022-07-23 05:43:36,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4273 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3442, Invalid=13588, Unknown=0, NotChecked=0, Total=17030 [2022-07-23 05:43:36,030 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 177 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:43:36,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 308 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 05:43:36,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-23 05:43:36,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2022-07-23 05:43:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 173 states have (on average 1.0173410404624277) internal successors, (176), 174 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2022-07-23 05:43:36,031 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 166 [2022-07-23 05:43:36,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:43:36,032 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2022-07-23 05:43:36,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 3.7522935779816513) internal successors, (409), 109 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2022-07-23 05:43:36,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-23 05:43:36,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:43:36,032 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:43:36,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-07-23 05:43:36,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-07-23 05:43:36,233 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-23 05:43:36,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:43:36,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1922890399, now seen corresponding path program 15 times [2022-07-23 05:43:36,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:43:36,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961212867] [2022-07-23 05:43:36,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:43:36,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:43:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:43:36,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 630 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:36,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:43:36,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961212867] [2022-07-23 05:43:36,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961212867] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:43:36,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971642581] [2022-07-23 05:43:36,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:43:36,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:43:36,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:43:36,948 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:43:36,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-07-23 05:43:52,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2022-07-23 05:43:52,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:43:53,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 111 conjunts are in the unsatisfiable core [2022-07-23 05:43:53,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:43:53,011 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-23 05:43:53,015 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-23 05:43:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 703 proven. 877 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:55,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:43:58,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 780 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:58,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971642581] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:43:58,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:43:58,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 44, 44] total 129 [2022-07-23 05:43:58,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990581870] [2022-07-23 05:43:58,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:43:58,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2022-07-23 05:43:58,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:43:58,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2022-07-23 05:43:58,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2157, Invalid=14613, Unknown=0, NotChecked=0, Total=16770 [2022-07-23 05:43:58,138 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand has 130 states, 129 states have (on average 3.891472868217054) internal successors, (502), 130 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)