./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3a877d22 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/termination-crafted/4BitCounterPointer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 14:07:45,902 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 14:07:45,906 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 14:07:45,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 14:07:45,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 14:07:45,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 14:07:45,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 14:07:45,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 14:07:45,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 14:07:45,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 14:07:45,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 14:07:45,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 14:07:45,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 14:07:45,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 14:07:45,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 14:07:45,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 14:07:45,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 14:07:45,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 14:07:45,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 14:07:45,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 14:07:45,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 14:07:45,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 14:07:45,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 14:07:45,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 14:07:45,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 14:07:45,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 14:07:45,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 14:07:45,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 14:07:45,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 14:07:45,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 14:07:45,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 14:07:45,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 14:07:45,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 14:07:45,987 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 14:07:45,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 14:07:45,988 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 14:07:45,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 14:07:45,988 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 14:07:45,988 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 14:07:45,989 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 14:07:45,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 14:07:45,992 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2021-12-15 14:07:46,012 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 14:07:46,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 14:07:46,013 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 14:07:46,013 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 14:07:46,014 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 14:07:46,014 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 14:07:46,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 14:07:46,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 14:07:46,015 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 14:07:46,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 14:07:46,016 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 14:07:46,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 14:07:46,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 14:07:46,016 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-15 14:07:46,016 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-15 14:07:46,017 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-15 14:07:46,017 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 14:07:46,017 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-15 14:07:46,017 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 14:07:46,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 14:07:46,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 14:07:46,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 14:07:46,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:07:46,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 14:07:46,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 14:07:46,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 14:07:46,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 14:07:46,020 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 14:07:46,020 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 [2021-12-15 14:07:46,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 14:07:46,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 14:07:46,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 14:07:46,271 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 14:07:46,272 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 14:07:46,273 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2021-12-15 14:07:46,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2c706cf5/d095ff70f78a4580a1bac2353dce76a2/FLAG341343bb0 [2021-12-15 14:07:46,695 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 14:07:46,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2021-12-15 14:07:46,704 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2c706cf5/d095ff70f78a4580a1bac2353dce76a2/FLAG341343bb0 [2021-12-15 14:07:47,127 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2c706cf5/d095ff70f78a4580a1bac2353dce76a2 [2021-12-15 14:07:47,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 14:07:47,131 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 14:07:47,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 14:07:47,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 14:07:47,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 14:07:47,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:07:47" (1/1) ... [2021-12-15 14:07:47,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30e6f266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:47, skipping insertion in model container [2021-12-15 14:07:47,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 02:07:47" (1/1) ... [2021-12-15 14:07:47,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 14:07:47,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 14:07:47,292 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:07:47,298 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 14:07:47,309 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 14:07:47,319 INFO L208 MainTranslator]: Completed translation [2021-12-15 14:07:47,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:47 WrapperNode [2021-12-15 14:07:47,320 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 14:07:47,321 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 14:07:47,321 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 14:07:47,321 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 14:07:47,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:47" (1/1) ... [2021-12-15 14:07:47,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:47" (1/1) ... [2021-12-15 14:07:47,344 INFO L137 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2021-12-15 14:07:47,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 14:07:47,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 14:07:47,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 14:07:47,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 14:07:47,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:47" (1/1) ... [2021-12-15 14:07:47,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:47" (1/1) ... [2021-12-15 14:07:47,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:47" (1/1) ... [2021-12-15 14:07:47,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:47" (1/1) ... [2021-12-15 14:07:47,369 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:47" (1/1) ... [2021-12-15 14:07:47,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:47" (1/1) ... [2021-12-15 14:07:47,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:47" (1/1) ... [2021-12-15 14:07:47,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 14:07:47,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 14:07:47,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 14:07:47,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 14:07:47,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:47" (1/1) ... [2021-12-15 14:07:47,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 14:07:47,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:47,445 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) [2021-12-15 14:07:47,463 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 [2021-12-15 14:07:47,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-15 14:07:47,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 14:07:47,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 14:07:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-15 14:07:47,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-15 14:07:47,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-15 14:07:47,538 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 14:07:47,539 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 14:07:47,686 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 14:07:47,691 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 14:07:47,691 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 14:07:47,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:07:47 BoogieIcfgContainer [2021-12-15 14:07:47,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 14:07:47,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 14:07:47,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 14:07:47,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 14:07:47,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 02:07:47" (1/3) ... [2021-12-15 14:07:47,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a206b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:07:47, skipping insertion in model container [2021-12-15 14:07:47,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 02:07:47" (2/3) ... [2021-12-15 14:07:47,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a206b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 02:07:47, skipping insertion in model container [2021-12-15 14:07:47,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 02:07:47" (3/3) ... [2021-12-15 14:07:47,704 INFO L111 eAbstractionObserver]: Analyzing ICFG 4BitCounterPointer.c [2021-12-15 14:07:47,709 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 14:07:47,709 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2021-12-15 14:07:47,761 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 14:07:47,782 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 14:07:47,795 INFO L340 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2021-12-15 14:07:47,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 24 states have (on average 2.5) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:47,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:07:47,822 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:47,823 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:07:47,823 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-12-15 14:07:47,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:47,828 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-15 14:07:47,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:47,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12338957] [2021-12-15 14:07:47,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:47,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:48,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:48,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12338957] [2021-12-15 14:07:48,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12338957] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:48,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:48,006 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:07:48,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847196096] [2021-12-15 14:07:48,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:48,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:07:48,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:48,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:07:48,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:07:48,038 INFO L87 Difference]: Start difference. First operand has 56 states, 24 states have (on average 2.5) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:48,122 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2021-12-15 14:07:48,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:07:48,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-12-15 14:07:48,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:48,135 INFO L225 Difference]: With dead ends: 52 [2021-12-15 14:07:48,135 INFO L226 Difference]: Without dead ends: 50 [2021-12-15 14:07:48,138 INFO L932 BasicCegarLoop]: 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 [2021-12-15 14:07:48,149 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:48,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 25 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:07:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-12-15 14:07:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2021-12-15 14:07:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 49 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) [2021-12-15 14:07:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2021-12-15 14:07:48,191 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 3 [2021-12-15 14:07:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:48,192 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2021-12-15 14:07:48,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2021-12-15 14:07:48,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-15 14:07:48,193 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:48,193 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-15 14:07:48,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 14:07:48,194 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-12-15 14:07:48,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:48,197 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-15 14:07:48,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:48,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571136016] [2021-12-15 14:07:48,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:48,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:48,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:48,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571136016] [2021-12-15 14:07:48,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571136016] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:48,304 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:48,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:07:48,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289651022] [2021-12-15 14:07:48,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:48,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:07:48,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:48,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:07:48,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:07:48,307 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:48,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:48,371 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2021-12-15 14:07:48,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:07:48,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-12-15 14:07:48,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:48,373 INFO L225 Difference]: With dead ends: 46 [2021-12-15 14:07:48,374 INFO L226 Difference]: Without dead ends: 46 [2021-12-15 14:07:48,375 INFO L932 BasicCegarLoop]: 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 [2021-12-15 14:07:48,376 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:48,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 24 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:07:48,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-15 14:07:48,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-12-15 14:07:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 23 states have (on average 2.130434782608696) internal successors, (49), 45 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) [2021-12-15 14:07:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2021-12-15 14:07:48,384 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 3 [2021-12-15 14:07:48,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:48,384 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2021-12-15 14:07:48,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2021-12-15 14:07:48,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-15 14:07:48,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:48,386 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-15 14:07:48,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 14:07:48,386 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-12-15 14:07:48,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:48,387 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2021-12-15 14:07:48,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:48,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221364775] [2021-12-15 14:07:48,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:48,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:48,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:48,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:48,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221364775] [2021-12-15 14:07:48,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221364775] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:48,452 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:48,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:07:48,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486084025] [2021-12-15 14:07:48,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:48,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:07:48,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:48,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:07:48,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:07:48,456 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:48,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:48,495 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2021-12-15 14:07:48,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:07:48,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-12-15 14:07:48,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:48,497 INFO L225 Difference]: With dead ends: 42 [2021-12-15 14:07:48,497 INFO L226 Difference]: Without dead ends: 42 [2021-12-15 14:07:48,498 INFO L932 BasicCegarLoop]: 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 [2021-12-15 14:07:48,500 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:48,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 18 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-12-15 14:07:48,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-12-15 14:07:48,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 41 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) [2021-12-15 14:07:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2021-12-15 14:07:48,511 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 4 [2021-12-15 14:07:48,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:48,511 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2021-12-15 14:07:48,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2021-12-15 14:07:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-15 14:07:48,513 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:48,513 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-15 14:07:48,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-15 14:07:48,514 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-12-15 14:07:48,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2021-12-15 14:07:48,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:48,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961579119] [2021-12-15 14:07:48,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:48,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:48,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:48,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961579119] [2021-12-15 14:07:48,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961579119] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:48,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:48,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:07:48,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288355473] [2021-12-15 14:07:48,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:48,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:07:48,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:48,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:07:48,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:07:48,598 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:48,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:48,633 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2021-12-15 14:07:48,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:07:48,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-12-15 14:07:48,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:48,635 INFO L225 Difference]: With dead ends: 38 [2021-12-15 14:07:48,635 INFO L226 Difference]: Without dead ends: 38 [2021-12-15 14:07:48,636 INFO L932 BasicCegarLoop]: 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 [2021-12-15 14:07:48,644 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 20 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 [2021-12-15 14:07:48,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 20 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-15 14:07:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-12-15 14:07:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:48,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2021-12-15 14:07:48,653 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 4 [2021-12-15 14:07:48,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:48,654 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2021-12-15 14:07:48,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:48,654 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2021-12-15 14:07:48,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-15 14:07:48,654 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:48,654 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-15 14:07:48,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-15 14:07:48,655 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-12-15 14:07:48,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:48,655 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2021-12-15 14:07:48,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:48,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014050668] [2021-12-15 14:07:48,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:48,656 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:48,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:48,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014050668] [2021-12-15 14:07:48,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014050668] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:48,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:48,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:07:48,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702218532] [2021-12-15 14:07:48,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:48,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:07:48,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:48,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:07:48,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:07:48,696 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:48,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:48,723 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2021-12-15 14:07:48,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:07:48,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-15 14:07:48,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:48,724 INFO L225 Difference]: With dead ends: 34 [2021-12-15 14:07:48,725 INFO L226 Difference]: Without dead ends: 34 [2021-12-15 14:07:48,725 INFO L932 BasicCegarLoop]: 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 [2021-12-15 14:07:48,726 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:48,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 14 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:48,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-15 14:07:48,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-12-15 14:07:48,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.608695652173913) internal successors, (37), 33 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) [2021-12-15 14:07:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2021-12-15 14:07:48,729 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 5 [2021-12-15 14:07:48,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:48,729 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2021-12-15 14:07:48,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:48,730 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2021-12-15 14:07:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-15 14:07:48,730 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:48,730 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-15 14:07:48,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-15 14:07:48,731 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-12-15 14:07:48,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:48,732 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2021-12-15 14:07:48,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:48,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048890715] [2021-12-15 14:07:48,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:48,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:48,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:48,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048890715] [2021-12-15 14:07:48,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048890715] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:48,768 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:48,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:07:48,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173306697] [2021-12-15 14:07:48,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:48,769 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:07:48,769 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:48,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:07:48,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:07:48,770 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:48,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:48,791 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2021-12-15 14:07:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:07:48,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-15 14:07:48,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:48,792 INFO L225 Difference]: With dead ends: 30 [2021-12-15 14:07:48,793 INFO L226 Difference]: Without dead ends: 30 [2021-12-15 14:07:48,793 INFO L932 BasicCegarLoop]: 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 [2021-12-15 14:07:48,794 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:48,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 16 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:48,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-15 14:07:48,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-15 14:07:48,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.434782608695652) internal successors, (33), 29 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) [2021-12-15 14:07:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2021-12-15 14:07:48,797 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 5 [2021-12-15 14:07:48,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:48,797 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2021-12-15 14:07:48,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:48,797 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2021-12-15 14:07:48,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 14:07:48,798 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:48,798 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 14:07:48,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-15 14:07:48,798 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-12-15 14:07:48,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:48,799 INFO L85 PathProgramCache]: Analyzing trace with hash 889446154, now seen corresponding path program 1 times [2021-12-15 14:07:48,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:48,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441218751] [2021-12-15 14:07:48,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:48,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:48,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:48,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:48,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441218751] [2021-12-15 14:07:48,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441218751] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:48,840 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:48,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:07:48,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989498311] [2021-12-15 14:07:48,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:48,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:07:48,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:48,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:07:48,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:07:48,841 INFO L87 Difference]: Start difference. First operand 30 states and 33 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) [2021-12-15 14:07:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:48,865 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2021-12-15 14:07:48,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:07:48,865 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 [2021-12-15 14:07:48,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:48,866 INFO L225 Difference]: With dead ends: 27 [2021-12-15 14:07:48,866 INFO L226 Difference]: Without dead ends: 27 [2021-12-15 14:07:48,866 INFO L932 BasicCegarLoop]: 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 [2021-12-15 14:07:48,867 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:48,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-15 14:07:48,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-12-15 14:07:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3043478260869565) 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) [2021-12-15 14:07:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2021-12-15 14:07:48,869 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2021-12-15 14:07:48,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:48,870 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2021-12-15 14:07:48,870 INFO L471 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) [2021-12-15 14:07:48,870 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2021-12-15 14:07:48,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 14:07:48,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:48,870 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 14:07:48,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-15 14:07:48,870 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-12-15 14:07:48,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:48,871 INFO L85 PathProgramCache]: Analyzing trace with hash 889446155, now seen corresponding path program 1 times [2021-12-15 14:07:48,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:48,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712262644] [2021-12-15 14:07:48,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:48,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:48,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:48,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:48,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712262644] [2021-12-15 14:07:48,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712262644] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:48,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:48,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 14:07:48,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675347069] [2021-12-15 14:07:48,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:48,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 14:07:48,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:48,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 14:07:48,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 14:07:48,900 INFO L87 Difference]: Start difference. First operand 27 states and 30 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) [2021-12-15 14:07:48,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:48,917 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2021-12-15 14:07:48,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 14:07:48,918 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 [2021-12-15 14:07:48,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:48,918 INFO L225 Difference]: With dead ends: 24 [2021-12-15 14:07:48,918 INFO L226 Difference]: Without dead ends: 24 [2021-12-15 14:07:48,919 INFO L932 BasicCegarLoop]: 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 [2021-12-15 14:07:48,919 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:48,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:48,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-12-15 14:07:48,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-12-15 14:07:48,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) 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) [2021-12-15 14:07:48,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2021-12-15 14:07:48,922 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 6 [2021-12-15 14:07:48,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:48,922 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2021-12-15 14:07:48,922 INFO L471 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) [2021-12-15 14:07:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2021-12-15 14:07:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-15 14:07:48,922 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:48,923 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:48,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-15 14:07:48,923 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-12-15 14:07:48,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:48,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1115961648, now seen corresponding path program 1 times [2021-12-15 14:07:48,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:48,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555384563] [2021-12-15 14:07:48,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:48,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:48,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:48,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:48,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555384563] [2021-12-15 14:07:48,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555384563] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:48,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:48,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:07:48,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305657204] [2021-12-15 14:07:48,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:48,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:07:48,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:48,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:07:48,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:07:48,954 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2021-12-15 14:07:48,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:48,994 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2021-12-15 14:07:48,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:07:48,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 [2021-12-15 14:07:48,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:48,995 INFO L225 Difference]: With dead ends: 39 [2021-12-15 14:07:48,995 INFO L226 Difference]: Without dead ends: 39 [2021-12-15 14:07:48,995 INFO L932 BasicCegarLoop]: 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 [2021-12-15 14:07:48,996 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:48,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 39 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:48,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-15 14:07:48,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2021-12-15 14:07:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) 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) [2021-12-15 14:07:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2021-12-15 14:07:48,999 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 10 [2021-12-15 14:07:48,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:48,999 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2021-12-15 14:07:48,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2021-12-15 14:07:48,999 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2021-12-15 14:07:49,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-15 14:07:49,000 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:49,000 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:49,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-15 14:07:49,000 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-12-15 14:07:49,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:49,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1456723757, now seen corresponding path program 1 times [2021-12-15 14:07:49,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:49,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594417061] [2021-12-15 14:07:49,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:49,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:49,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:49,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:49,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594417061] [2021-12-15 14:07:49,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594417061] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:49,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582822210] [2021-12-15 14:07:49,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:49,090 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:49,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:49,096 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) [2021-12-15 14:07:49,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 14:07:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:49,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-15 14:07:49,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:49,235 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-15 14:07:49,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2021-12-15 14:07:49,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:07:49,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 14:07:49,318 INFO L388 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 [2021-12-15 14:07:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:49,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:07:49,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2021-12-15 14:07:49,365 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:07:49,365 INFO L388 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 18 treesize of output 19 [2021-12-15 14:07:49,368 INFO L388 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 30 treesize of output 22 [2021-12-15 14:07:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-15 14:07:49,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582822210] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:07:49,392 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:07:49,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2021-12-15 14:07:49,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210441994] [2021-12-15 14:07:49,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:07:49,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 14:07:49,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:49,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 14:07:49,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2021-12-15 14:07:49,394 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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) [2021-12-15 14:07:49,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:49,467 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2021-12-15 14:07:49,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 14:07:49,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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) Word has length 15 [2021-12-15 14:07:49,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:49,468 INFO L225 Difference]: With dead ends: 46 [2021-12-15 14:07:49,468 INFO L226 Difference]: Without dead ends: 46 [2021-12-15 14:07:49,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=26, Unknown=1, NotChecked=10, Total=56 [2021-12-15 14:07:49,469 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:49,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 62 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2021-12-15 14:07:49,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-12-15 14:07:49,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2021-12-15 14:07:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:49,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-12-15 14:07:49,472 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2021-12-15 14:07:49,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:49,473 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-12-15 14:07:49,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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) [2021-12-15 14:07:49,473 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-12-15 14:07:49,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-15 14:07:49,474 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:49,474 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:49,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 14:07:49,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-15 14:07:49,696 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-12-15 14:07:49,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:49,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1715432197, now seen corresponding path program 1 times [2021-12-15 14:07:49,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:49,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838547562] [2021-12-15 14:07:49,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:49,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:49,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:49,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:49,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838547562] [2021-12-15 14:07:49,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838547562] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:49,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427975484] [2021-12-15 14:07:49,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:49,860 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:49,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:49,861 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) [2021-12-15 14:07:49,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 14:07:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:49,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-15 14:07:49,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:49,949 INFO L388 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 18 treesize of output 16 [2021-12-15 14:07:49,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:07:50,131 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 14:07:50,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2021-12-15 14:07:50,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 14:07:50,197 INFO L388 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 [2021-12-15 14:07:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:50,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:07:50,253 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2021-12-15 14:07:50,274 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2021-12-15 14:07:50,285 WARN L838 $PredicateComparison]: unable to prove that (or (= 0 |c_ULTIMATE.start_main_#t~mem5#1|) (forall ((v_ArrVal_298 (Array Int Int)) (v_ArrVal_297 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_298) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) is different from false [2021-12-15 14:07:50,393 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-12-15 14:07:50,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 50 [2021-12-15 14:07:50,405 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-12-15 14:07:50,406 INFO L388 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 129 treesize of output 113 [2021-12-15 14:07:50,415 INFO L388 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 45 treesize of output 41 [2021-12-15 14:07:50,418 INFO L388 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 86 treesize of output 78 [2021-12-15 14:07:50,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:50,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427975484] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:07:50,499 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:07:50,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2021-12-15 14:07:50,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863763983] [2021-12-15 14:07:50,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:07:50,500 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-15 14:07:50,500 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:50,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-15 14:07:50,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=272, Unknown=6, NotChecked=108, Total=462 [2021-12-15 14:07:50,501 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:50,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:50,801 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2021-12-15 14:07:50,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-15 14:07:50,802 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-15 14:07:50,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:50,802 INFO L225 Difference]: With dead ends: 51 [2021-12-15 14:07:50,802 INFO L226 Difference]: Without dead ends: 51 [2021-12-15 14:07:50,803 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=525, Unknown=6, NotChecked=156, Total=870 [2021-12-15 14:07:50,803 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 49 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:50,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 114 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 149 Invalid, 0 Unknown, 116 Unchecked, 0.1s Time] [2021-12-15 14:07:50,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-12-15 14:07:50,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2021-12-15 14:07:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 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) [2021-12-15 14:07:50,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2021-12-15 14:07:50,807 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 18 [2021-12-15 14:07:50,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:50,807 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2021-12-15 14:07:50,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2021-12-15 14:07:50,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-15 14:07:50,808 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:50,809 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:50,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 14:07:51,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-12-15 14:07:51,010 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-12-15 14:07:51,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1201930977, now seen corresponding path program 1 times [2021-12-15 14:07:51,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:51,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486685299] [2021-12-15 14:07:51,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:51,011 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:51,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:51,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486685299] [2021-12-15 14:07:51,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486685299] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:51,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:51,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-15 14:07:51,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070397740] [2021-12-15 14:07:51,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:51,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-15 14:07:51,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:51,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-15 14:07:51,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-15 14:07:51,210 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2021-12-15 14:07:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:51,467 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2021-12-15 14:07:51,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-15 14:07:51,468 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) Word has length 21 [2021-12-15 14:07:51,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:51,469 INFO L225 Difference]: With dead ends: 67 [2021-12-15 14:07:51,469 INFO L226 Difference]: Without dead ends: 67 [2021-12-15 14:07:51,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2021-12-15 14:07:51,470 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 74 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:51,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 67 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 14:07:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-15 14:07:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 52. [2021-12-15 14:07:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2021-12-15 14:07:51,473 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 21 [2021-12-15 14:07:51,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:51,473 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2021-12-15 14:07:51,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 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) [2021-12-15 14:07:51,474 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2021-12-15 14:07:51,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-15 14:07:51,474 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:51,474 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:51,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-15 14:07:51,475 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-12-15 14:07:51,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:51,475 INFO L85 PathProgramCache]: Analyzing trace with hash -2128935000, now seen corresponding path program 1 times [2021-12-15 14:07:51,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:51,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276763578] [2021-12-15 14:07:51,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:51,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:51,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:51,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276763578] [2021-12-15 14:07:51,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276763578] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:51,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402800341] [2021-12-15 14:07:51,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:51,826 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:51,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:51,827 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) [2021-12-15 14:07:51,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 14:07:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:51,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-15 14:07:51,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:51,909 INFO L388 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 18 treesize of output 16 [2021-12-15 14:07:51,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:07:52,088 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 14:07:52,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2021-12-15 14:07:52,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 14:07:52,162 INFO L388 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 [2021-12-15 14:07:52,178 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:52,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:07:52,215 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_403) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2021-12-15 14:07:52,227 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_403 (Array Int Int)) (v_ArrVal_402 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402) |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_403) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2021-12-15 14:07:52,294 INFO L388 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 67 treesize of output 59 [2021-12-15 14:07:52,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-12-15 14:07:52,302 INFO L388 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 38 treesize of output 34 [2021-12-15 14:07:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-15 14:07:52,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402800341] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:07:52,398 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:07:52,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2021-12-15 14:07:52,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316270236] [2021-12-15 14:07:52,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:07:52,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-15 14:07:52,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:52,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-15 14:07:52,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=432, Unknown=2, NotChecked=86, Total=600 [2021-12-15 14:07:52,400 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:52,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:52,976 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2021-12-15 14:07:52,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-15 14:07:52,976 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-15 14:07:52,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:52,977 INFO L225 Difference]: With dead ends: 94 [2021-12-15 14:07:52,977 INFO L226 Difference]: Without dead ends: 73 [2021-12-15 14:07:52,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=278, Invalid=918, Unknown=2, NotChecked=134, Total=1332 [2021-12-15 14:07:52,978 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 103 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:52,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 130 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 265 Invalid, 0 Unknown, 118 Unchecked, 0.2s Time] [2021-12-15 14:07:52,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-15 14:07:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 54. [2021-12-15 14:07:52,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 53 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) [2021-12-15 14:07:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2021-12-15 14:07:52,982 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 23 [2021-12-15 14:07:52,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:52,982 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2021-12-15 14:07:52,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.48) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2021-12-15 14:07:52,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-15 14:07:52,983 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:52,984 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:53,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-15 14:07:53,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:53,185 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-12-15 14:07:53,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:53,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1038287010, now seen corresponding path program 1 times [2021-12-15 14:07:53,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:53,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820279995] [2021-12-15 14:07:53,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:53,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:53,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:53,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820279995] [2021-12-15 14:07:53,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820279995] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:53,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140963505] [2021-12-15 14:07:53,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:53,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:53,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:53,701 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) [2021-12-15 14:07:53,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 14:07:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:53,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-15 14:07:53,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:53,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:07:53,871 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-15 14:07:53,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-15 14:07:53,910 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:07:53,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-15 14:07:53,921 INFO L388 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 [2021-12-15 14:07:54,012 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:07:54,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2021-12-15 14:07:54,020 INFO L388 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 [2021-12-15 14:07:54,208 INFO L354 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2021-12-15 14:07:54,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 44 [2021-12-15 14:07:54,251 INFO L388 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 [2021-12-15 14:07:54,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:54,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:07:54,389 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_477 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_477 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= 0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|))))) is different from false [2021-12-15 14:07:54,425 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_476))) (or (= (select (select (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_477 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= 0 (select (select (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_477) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|)))))) is different from false [2021-12-15 14:07:54,436 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_476 (Array Int Int)) (|ULTIMATE.start_main_~x2~0#1.base| Int) (v_ArrVal_477 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |ULTIMATE.start_main_~x2~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset| 0)) |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_476))) (or (not (= 0 (select (select (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_477) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|))) (= (select (select (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_477 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0)))) is different from false [2021-12-15 14:07:54,454 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-12-15 14:07:54,454 INFO L388 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 2 case distinctions, treesize of input 79 treesize of output 47 [2021-12-15 14:07:54,459 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-12-15 14:07:54,459 INFO L388 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 96 treesize of output 84 [2021-12-15 14:07:54,464 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:07:54,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 81 [2021-12-15 14:07:54,473 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:07:54,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2021-12-15 14:07:54,582 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-15 14:07:54,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140963505] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:07:54,582 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:07:54,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2021-12-15 14:07:54,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474997451] [2021-12-15 14:07:54,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:07:54,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-15 14:07:54,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:54,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-15 14:07:54,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=412, Unknown=3, NotChecked=132, Total=650 [2021-12-15 14:07:54,585 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:54,628 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~x1~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (not (= |c_ULTIMATE.start_main_#t~malloc0#1.base| |c_ULTIMATE.start_main_#t~malloc1#1.base|)) (= 0 |c_ULTIMATE.start_main_~x3~0#1.offset|) (not (= |c_ULTIMATE.start_main_~x1~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (= 0 |c_ULTIMATE.start_main_~x2~0#1.offset|) (= 0 |c_ULTIMATE.start_main_~x0~0#1.offset|) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_476 (Array Int Int)) (|ULTIMATE.start_main_~x2~0#1.base| Int) (v_ArrVal_477 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |ULTIMATE.start_main_~x2~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset| 0)) |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_476))) (or (not (= 0 (select (select (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_477) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|))) (= (select (select (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_477 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0)))) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) is different from false [2021-12-15 14:07:54,631 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~x1~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (not (= |c_ULTIMATE.start_main_#t~malloc0#1.base| |c_ULTIMATE.start_main_#t~malloc1#1.base|)) (= 0 |c_ULTIMATE.start_main_~x3~0#1.offset|) (not (= |c_ULTIMATE.start_main_~x1~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (= 0 |c_ULTIMATE.start_main_~x0~0#1.offset|) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_476 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_476))) (or (= (select (select (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_477 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= 0 (select (select (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_477) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|)))))) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) is different from false [2021-12-15 14:07:54,634 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~x1~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (.cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0))) (and (not (= |c_ULTIMATE.start_main_~x1~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (or .cse0 .cse1) (not (= |c_ULTIMATE.start_main_#t~malloc0#1.base| |c_ULTIMATE.start_main_#t~malloc1#1.base|)) (= 0 |c_ULTIMATE.start_main_~x3~0#1.offset|) (not .cse0) .cse1 (= 0 |c_ULTIMATE.start_main_~x0~0#1.offset|) (forall ((|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_477 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_477 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= 0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|))))) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)))) is different from false [2021-12-15 14:07:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:55,183 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2021-12-15 14:07:55,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-15 14:07:55,184 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-15 14:07:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:55,184 INFO L225 Difference]: With dead ends: 79 [2021-12-15 14:07:55,184 INFO L226 Difference]: Without dead ends: 79 [2021-12-15 14:07:55,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=237, Invalid=971, Unknown=6, NotChecked=426, Total=1640 [2021-12-15 14:07:55,188 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:55,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 139 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 195 Invalid, 0 Unknown, 115 Unchecked, 0.1s Time] [2021-12-15 14:07:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-12-15 14:07:55,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2021-12-15 14:07:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 70 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2021-12-15 14:07:55,192 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 26 [2021-12-15 14:07:55,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:55,192 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2021-12-15 14:07:55,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.269230769230769) internal successors, (59), 26 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2021-12-15 14:07:55,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 14:07:55,193 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:55,193 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:55,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 14:07:55,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:55,411 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-12-15 14:07:55,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:55,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2058842818, now seen corresponding path program 2 times [2021-12-15 14:07:55,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:55,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262221635] [2021-12-15 14:07:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:55,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-15 14:07:55,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:55,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262221635] [2021-12-15 14:07:55,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262221635] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 14:07:55,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 14:07:55,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 14:07:55,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376065867] [2021-12-15 14:07:55,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 14:07:55,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-15 14:07:55,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:55,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 14:07:55,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 14:07:55,465 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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) [2021-12-15 14:07:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:55,485 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2021-12-15 14:07:55,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-15 14:07:55,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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) Word has length 36 [2021-12-15 14:07:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:55,487 INFO L225 Difference]: With dead ends: 69 [2021-12-15 14:07:55,488 INFO L226 Difference]: Without dead ends: 69 [2021-12-15 14:07:55,489 INFO L932 BasicCegarLoop]: 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 [2021-12-15 14:07:55,490 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:55,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 66 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 14:07:55,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-12-15 14:07:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2021-12-15 14:07:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 65 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2021-12-15 14:07:55,504 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 36 [2021-12-15 14:07:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:55,504 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2021-12-15 14:07:55,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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) [2021-12-15 14:07:55,505 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2021-12-15 14:07:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-15 14:07:55,507 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:55,507 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:55,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-15 14:07:55,507 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-12-15 14:07:55,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:55,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1795695146, now seen corresponding path program 1 times [2021-12-15 14:07:55,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:55,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71825156] [2021-12-15 14:07:55,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:55,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:56,071 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 14:07:56,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:56,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71825156] [2021-12-15 14:07:56,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71825156] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:56,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277435338] [2021-12-15 14:07:56,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:56,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:56,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:56,076 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) [2021-12-15 14:07:56,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-15 14:07:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:56,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-15 14:07:56,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:56,193 INFO L388 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 202 treesize of output 198 [2021-12-15 14:07:56,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:07:56,345 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:07:56,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2021-12-15 14:07:56,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 14:07:56,716 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-15 14:07:56,717 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 26 [2021-12-15 14:07:56,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 14:07:56,783 INFO L388 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 [2021-12-15 14:07:56,808 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-15 14:07:56,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:07:56,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2021-12-15 14:07:56,838 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2021-12-15 14:07:56,849 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (= 0 |c_ULTIMATE.start_main_#t~mem6#1|)) is different from false [2021-12-15 14:07:56,901 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_603 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_603))) (or (= (select (select (store (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (= 0 (select (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|))))) is different from false [2021-12-15 14:07:56,968 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:07:56,968 INFO L388 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 263 treesize of output 258 [2021-12-15 14:07:56,978 INFO L388 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 210 treesize of output 202 [2021-12-15 14:07:56,983 INFO L388 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 202 treesize of output 186 [2021-12-15 14:07:56,993 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:07:56,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 107 [2021-12-15 14:07:57,397 INFO L388 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 16 treesize of output 12 [2021-12-15 14:07:57,482 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 21 refuted. 1 times theorem prover too weak. 3 trivial. 8 not checked. [2021-12-15 14:07:57,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277435338] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 14:07:57,482 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 14:07:57,482 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 37 [2021-12-15 14:07:57,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748212920] [2021-12-15 14:07:57,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 14:07:57,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-15 14:07:57,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 14:07:57,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-15 14:07:57,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=914, Unknown=8, NotChecked=260, Total=1332 [2021-12-15 14:07:57,485 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:57,635 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (let ((.cse0 (not .cse2)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|))) (and (or .cse0 (= |c_ULTIMATE.start_main_~x0~0#1.offset| |c_ULTIMATE.start_main_~x3~0#1.offset|)) (= 0 |c_ULTIMATE.start_main_~x3~0#1.offset|) (= 0 .cse1) (= 0 |c_ULTIMATE.start_main_~x0~0#1.offset|) .cse0 (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (or .cse2 (let ((.cse3 (= |c_ULTIMATE.start_main_~x1~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (and (or (and (= .cse1 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) .cse3) (or (not .cse3) (and (= |c_ULTIMATE.start_main_#t~malloc1#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |c_ULTIMATE.start_main_~x1~0#1.offset| |c_ULTIMATE.start_main_~x3~0#1.offset|)))))) (forall ((v_ArrVal_603 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_603))) (or (= (select (select (store (store .cse4 |ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (= 0 (select (select .cse4 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|)))))))) is different from false [2021-12-15 14:07:57,782 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base|))) (let ((.cse8 (= |c_ULTIMATE.start_main_~x1~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|)) (.cse4 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (.cse10 (select .cse12 |c_ULTIMATE.start_main_~x0~0#1.offset|))) (let ((.cse2 (= |c_ULTIMATE.start_main_~x0~0#1.offset| |c_ULTIMATE.start_main_~x3~0#1.offset|)) (.cse1 (= 1 .cse10)) (.cse0 (not .cse4)) (.cse11 (= .cse3 0)) (.cse9 (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (.cse5 (not .cse8)) (.cse6 (= |c_ULTIMATE.start_main_#t~malloc1#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (.cse7 (= |c_ULTIMATE.start_main_~x1~0#1.offset| |c_ULTIMATE.start_main_~x3~0#1.offset|))) (and (or .cse0 (and .cse1 .cse2)) (or .cse0 .cse2) (= 0 |c_ULTIMATE.start_main_~x3~0#1.offset|) (= 0 .cse3) (or .cse4 (and (or .cse5 (and .cse6 .cse1 .cse7)) (or .cse8 (and (or .cse9 (and (= .cse10 0) (= |c_ULTIMATE.start_main_#t~malloc2#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|))) .cse11)))) (= 0 |c_ULTIMATE.start_main_~x0~0#1.offset|) .cse0 (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (or .cse4 (and (or (and .cse11 .cse9) .cse8) (or .cse5 (and .cse6 .cse7)))) (= (select .cse12 0) 1) (forall ((v_ArrVal_603 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_603))) (or (= (select (select (store (store .cse13 |ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (= 0 (select (select .cse13 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|))))))))) is different from false [2021-12-15 14:07:57,785 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_ULTIMATE.start_main_~x1~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|)) (.cse2 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (let ((.cse6 (= 1 |c_ULTIMATE.start_main_#t~mem5#1|)) (.cse1 (= |c_ULTIMATE.start_main_~x0~0#1.offset| |c_ULTIMATE.start_main_~x3~0#1.offset|)) (.cse0 (not .cse2)) (.cse4 (= .cse10 0)) (.cse5 (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (.cse9 (not .cse3)) (.cse7 (= |c_ULTIMATE.start_main_#t~malloc1#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (.cse8 (= |c_ULTIMATE.start_main_~x1~0#1.offset| |c_ULTIMATE.start_main_~x3~0#1.offset|))) (and (or .cse0 .cse1) (or .cse2 (and (or .cse3 (and .cse4 (or (and (= |c_ULTIMATE.start_main_#t~mem5#1| 0) (= |c_ULTIMATE.start_main_#t~malloc2#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) .cse5))) (or (and .cse6 .cse7 .cse8) .cse9))) (= 0 |c_ULTIMATE.start_main_~x3~0#1.offset|) (= 0 .cse10) (or (and .cse6 .cse1) .cse0) (= 0 |c_ULTIMATE.start_main_~x0~0#1.offset|) .cse0 (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (or .cse2 (and (or (and .cse4 .cse5) .cse3) (or .cse9 (and .cse7 .cse8)))) (forall ((v_ArrVal_603 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_603))) (or (= (select (select (store (store .cse11 |ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (= 0 (select (select .cse11 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|)))))))) is different from false [2021-12-15 14:07:57,789 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (let ((.cse0 (not .cse2)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|))) (and (or .cse0 (= |c_ULTIMATE.start_main_~x0~0#1.offset| |c_ULTIMATE.start_main_~x3~0#1.offset|)) (= 0 |c_ULTIMATE.start_main_~x3~0#1.offset|) (= 0 .cse1) .cse0 (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (or .cse2 (let ((.cse3 (= |c_ULTIMATE.start_main_~x1~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (and (or (and (= .cse1 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) .cse3) (or (not .cse3) (and (= |c_ULTIMATE.start_main_#t~malloc1#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |c_ULTIMATE.start_main_~x1~0#1.offset| |c_ULTIMATE.start_main_~x3~0#1.offset|)))))) (forall ((v_ArrVal_603 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_603))) (or (= (select (select (store (store .cse4 |ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (= 0 (select (select .cse4 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|)))))))) is different from false [2021-12-15 14:07:57,964 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|))) (and (= .cse0 0) (= 0 |c_ULTIMATE.start_main_~x3~0#1.offset|) (= 0 .cse0) (not (= |c_ULTIMATE.start_main_~x1~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (forall ((v_ArrVal_603 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_603))) (or (= (select (select (store (store .cse1 |ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (= 0 (select (select .cse1 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|))))))) is different from false [2021-12-15 14:07:58,235 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|))) (and (= .cse0 0) (= 0 |c_ULTIMATE.start_main_~x3~0#1.offset|) (= 0 .cse0) (not (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|) 0))) (not (= |c_ULTIMATE.start_main_~x1~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (forall ((v_ArrVal_603 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_603))) (or (= (select (select (store (store .cse1 |ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (= 0 (select (select .cse1 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|))))))) is different from false [2021-12-15 14:07:58,382 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x1~0#1.offset| |c_ULTIMATE.start_main_~x3~0#1.offset|) (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x0~0#1.base|)) (forall ((v_ArrVal_603 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int) (v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_603))) (or (= (select (select (store (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (= 0 (select (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|)))))) is different from false [2021-12-15 14:07:58,398 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (or (= 0 (select (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|)) (forall ((v_ArrVal_605 (Array Int Int)) (v_ArrVal_604 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_604) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_605) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x1~0#1.offset| |c_ULTIMATE.start_main_~x3~0#1.offset|) (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x0~0#1.base|))) is different from false [2021-12-15 14:07:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 14:07:58,473 INFO L93 Difference]: Finished difference Result 145 states and 163 transitions. [2021-12-15 14:07:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-15 14:07:58,474 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-15 14:07:58,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 14:07:58,475 INFO L225 Difference]: With dead ends: 145 [2021-12-15 14:07:58,475 INFO L226 Difference]: Without dead ends: 145 [2021-12-15 14:07:58,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 64 ConstructedPredicates, 12 IntricatePredicates, 1 DeprecatedPredicates, 809 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=593, Invalid=2288, Unknown=29, NotChecked=1380, Total=4290 [2021-12-15 14:07:58,477 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 86 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 364 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 14:07:58,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 203 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 454 Invalid, 0 Unknown, 364 Unchecked, 0.3s Time] [2021-12-15 14:07:58,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-15 14:07:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 92. [2021-12-15 14:07:58,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.1538461538461537) internal successors, (105), 91 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:58,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2021-12-15 14:07:58,481 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 39 [2021-12-15 14:07:58,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 14:07:58,482 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2021-12-15 14:07:58,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 14:07:58,482 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2021-12-15 14:07:58,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-15 14:07:58,482 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 14:07:58,482 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 14:07:58,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-15 14:07:58,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-15 14:07:58,708 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-12-15 14:07:58,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 14:07:58,708 INFO L85 PathProgramCache]: Analyzing trace with hash 499699325, now seen corresponding path program 1 times [2021-12-15 14:07:58,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 14:07:58,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171797766] [2021-12-15 14:07:58,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:58,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 14:07:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-12-15 14:07:59,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 14:07:59,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171797766] [2021-12-15 14:07:59,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171797766] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 14:07:59,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519441805] [2021-12-15 14:07:59,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 14:07:59,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 14:07:59,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 14:07:59,023 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) [2021-12-15 14:07:59,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-15 14:07:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 14:07:59,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-15 14:07:59,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 14:07:59,132 INFO L388 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 838 treesize of output 822 [2021-12-15 14:07:59,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-15 14:07:59,239 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-15 14:07:59,303 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:07:59,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-15 14:07:59,309 INFO L388 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 [2021-12-15 14:07:59,395 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:07:59,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2021-12-15 14:07:59,447 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:07:59,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2021-12-15 14:07:59,452 INFO L388 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 [2021-12-15 14:07:59,557 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-15 14:07:59,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 27 [2021-12-15 14:07:59,644 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-12-15 14:07:59,644 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2021-12-15 14:07:59,743 INFO L354 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2021-12-15 14:07:59,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 44 [2021-12-15 14:07:59,803 INFO L388 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 [2021-12-15 14:07:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-15 14:07:59,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 14:07:59,873 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:07:59,873 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-15 14:08:00,058 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_697) |ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_698) |ULTIMATE.start_main_~x0~0#1.base| v_arrayElimArr_4))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~x0~0#1.offset|) 0)))) is different from false [2021-12-15 14:08:00,114 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_arrayElimArr_4 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int)) (v_ArrVal_697 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_695) |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_697) |ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_698) |ULTIMATE.start_main_~x0~0#1.base| v_arrayElimArr_4))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= (select v_arrayElimArr_4 |c_ULTIMATE.start_main_~x0~0#1.offset|) 0)))) is different from false [2021-12-15 14:08:00,123 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:08:00,123 INFO L388 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 55 treesize of output 48 [2021-12-15 14:08:00,163 INFO L388 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 542718 treesize of output 538618 [2021-12-15 14:08:13,112 WARN L227 SmtUtils]: Spent 11.25s on a formula simplification. DAG size of input: 1536 DAG size of output: 1536 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-15 14:08:13,166 INFO L388 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 579318 treesize of output 554742 [2021-12-15 14:08:35,137 WARN L227 SmtUtils]: Spent 21.97s on a formula simplification. DAG size of input: 1379 DAG size of output: 1377 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-15 14:08:35,179 INFO L388 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 513782 treesize of output 509686 [2021-12-15 14:08:36,820 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-15 14:08:36,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 558588 treesize of output 525826 [2021-12-15 14:08:59,573 WARN L227 SmtUtils]: Spent 22.75s on a formula simplification. DAG size of input: 1334 DAG size of output: 1328 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)