./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 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/list-simple/dll2n_remove_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 22:02:43,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 22:02:43,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 22:02:43,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 22:02:43,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 22:02:43,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 22:02:43,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 22:02:43,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 22:02:43,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 22:02:43,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 22:02:43,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 22:02:43,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 22:02:43,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 22:02:43,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 22:02:43,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 22:02:43,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 22:02:43,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 22:02:43,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 22:02:43,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 22:02:43,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 22:02:43,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 22:02:43,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 22:02:43,363 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 22:02:43,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 22:02:43,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 22:02:43,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 22:02:43,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 22:02:43,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 22:02:43,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 22:02:43,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 22:02:43,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 22:02:43,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 22:02:43,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 22:02:43,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 22:02:43,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 22:02:43,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 22:02:43,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 22:02:43,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 22:02:43,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 22:02:43,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 22:02:43,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 22:02:43,380 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 22:02:43,411 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 22:02:43,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 22:02:43,412 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 22:02:43,412 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 22:02:43,413 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 22:02:43,413 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 22:02:43,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 22:02:43,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 22:02:43,414 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 22:02:43,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 22:02:43,415 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 22:02:43,415 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 22:02:43,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 22:02:43,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 22:02:43,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 22:02:43,416 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 22:02:43,416 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 22:02:43,416 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 22:02:43,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 22:02:43,417 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 22:02:43,417 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 22:02:43,417 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 22:02:43,417 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 22:02:43,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 22:02:43,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 22:02:43,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 22:02:43,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 22:02:43,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 22:02:43,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 22:02:43,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 22:02:43,419 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 22:02:43,419 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 [2021-12-18 22:02:43,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 22:02:43,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 22:02:43,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 22:02:43,712 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 22:02:43,712 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 22:02:43,713 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_remove_all.i [2021-12-18 22:02:43,794 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f8df7302/898abc89a20b462f8a27781eaee9b266/FLAG3192e2c36 [2021-12-18 22:02:44,263 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 22:02:44,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all.i [2021-12-18 22:02:44,288 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f8df7302/898abc89a20b462f8a27781eaee9b266/FLAG3192e2c36 [2021-12-18 22:02:44,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f8df7302/898abc89a20b462f8a27781eaee9b266 [2021-12-18 22:02:44,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 22:02:44,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 22:02:44,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 22:02:44,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 22:02:44,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 22:02:44,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:02:44" (1/1) ... [2021-12-18 22:02:44,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba02f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:02:44, skipping insertion in model container [2021-12-18 22:02:44,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:02:44" (1/1) ... [2021-12-18 22:02:44,804 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 22:02:44,835 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 22:02:45,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all.i[24090,24103] [2021-12-18 22:02:45,055 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 22:02:45,064 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 22:02:45,099 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all.i[24090,24103] [2021-12-18 22:02:45,100 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 22:02:45,130 INFO L208 MainTranslator]: Completed translation [2021-12-18 22:02:45,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:02:45 WrapperNode [2021-12-18 22:02:45,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 22:02:45,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 22:02:45,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 22:02:45,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 22:02:45,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:02:45" (1/1) ... [2021-12-18 22:02:45,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:02:45" (1/1) ... [2021-12-18 22:02:45,190 INFO L137 Inliner]: procedures = 126, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2021-12-18 22:02:45,190 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 22:02:45,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 22:02:45,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 22:02:45,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 22:02:45,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:02:45" (1/1) ... [2021-12-18 22:02:45,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:02:45" (1/1) ... [2021-12-18 22:02:45,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:02:45" (1/1) ... [2021-12-18 22:02:45,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:02:45" (1/1) ... [2021-12-18 22:02:45,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:02:45" (1/1) ... [2021-12-18 22:02:45,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:02:45" (1/1) ... [2021-12-18 22:02:45,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:02:45" (1/1) ... [2021-12-18 22:02:45,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 22:02:45,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 22:02:45,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 22:02:45,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 22:02:45,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:02:45" (1/1) ... [2021-12-18 22:02:45,251 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 22:02:45,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:02:45,272 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-18 22:02:45,280 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-18 22:02:45,305 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-18 22:02:45,306 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-18 22:02:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 22:02:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 22:02:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 22:02:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 22:02:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 22:02:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 22:02:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 22:02:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 22:02:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 22:02:45,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 22:02:45,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 22:02:45,367 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 22:02:45,368 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 22:02:45,397 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-18 22:02:45,503 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 22:02:45,507 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 22:02:45,507 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-18 22:02:45,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:02:45 BoogieIcfgContainer [2021-12-18 22:02:45,508 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 22:02:45,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 22:02:45,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 22:02:45,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 22:02:45,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:02:44" (1/3) ... [2021-12-18 22:02:45,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762d5363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:02:45, skipping insertion in model container [2021-12-18 22:02:45,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:02:45" (2/3) ... [2021-12-18 22:02:45,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762d5363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:02:45, skipping insertion in model container [2021-12-18 22:02:45,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:02:45" (3/3) ... [2021-12-18 22:02:45,514 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2021-12-18 22:02:45,517 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 22:02:45,517 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2021-12-18 22:02:45,545 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 22:02:45,552 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-18 22:02:45,552 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2021-12-18 22:02:45,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 32 states have (on average 2.03125) internal successors, (65), 57 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:02:45,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-18 22:02:45,568 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:02:45,571 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-18 22:02:45,571 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:02:45,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:02:45,575 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2021-12-18 22:02:45,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:02:45,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753689124] [2021-12-18 22:02:45,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:02:45,581 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:02:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:02:45,723 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-18 22:02:45,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:02:45,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753689124] [2021-12-18 22:02:45,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753689124] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:02:45,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:02:45,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 22:02:45,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961421036] [2021-12-18 22:02:45,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:02:45,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:02:45,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:02:45,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:02:45,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:02:45,755 INFO L87 Difference]: Start difference. First operand has 59 states, 32 states have (on average 2.03125) internal successors, (65), 57 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 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-18 22:02:45,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:02:45,845 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2021-12-18 22:02:45,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:02:45,847 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-18 22:02:45,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:02:45,853 INFO L225 Difference]: With dead ends: 86 [2021-12-18 22:02:45,853 INFO L226 Difference]: Without dead ends: 81 [2021-12-18 22:02:45,854 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-18 22:02:45,857 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 43 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:02:45,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 93 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:02:45,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-18 22:02:45,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 51. [2021-12-18 22:02:45,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 50 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:02:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2021-12-18 22:02:45,890 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 5 [2021-12-18 22:02:45,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:02:45,891 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2021-12-18 22:02:45,891 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-18 22:02:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2021-12-18 22:02:45,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-18 22:02:45,892 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:02:45,892 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-18 22:02:45,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 22:02:45,893 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:02:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:02:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2021-12-18 22:02:45,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:02:45,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891530908] [2021-12-18 22:02:45,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:02:45,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:02:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:02:45,957 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-18 22:02:45,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:02:45,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891530908] [2021-12-18 22:02:45,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891530908] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:02:45,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:02:45,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 22:02:45,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756634350] [2021-12-18 22:02:45,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:02:45,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:02:45,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:02:45,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:02:45,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:02:45,962 INFO L87 Difference]: Start difference. First operand 51 states and 54 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-18 22:02:46,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:02:46,035 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2021-12-18 22:02:46,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:02:46,036 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-18 22:02:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:02:46,037 INFO L225 Difference]: With dead ends: 85 [2021-12-18 22:02:46,037 INFO L226 Difference]: Without dead ends: 85 [2021-12-18 22:02:46,038 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-18 22:02:46,039 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 47 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:02:46,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 96 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:02:46,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-18 22:02:46,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 48. [2021-12-18 22:02:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 47 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:02:46,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2021-12-18 22:02:46,046 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 5 [2021-12-18 22:02:46,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:02:46,047 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2021-12-18 22:02:46,048 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-18 22:02:46,048 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2021-12-18 22:02:46,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-18 22:02:46,049 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:02:46,049 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:02:46,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 22:02:46,049 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:02:46,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:02:46,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2100113076, now seen corresponding path program 1 times [2021-12-18 22:02:46,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:02:46,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859472629] [2021-12-18 22:02:46,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:02:46,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:02:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:02:46,077 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-18 22:02:46,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:02:46,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859472629] [2021-12-18 22:02:46,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859472629] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:02:46,078 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:02:46,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 22:02:46,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367609323] [2021-12-18 22:02:46,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:02:46,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:02:46,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:02:46,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:02:46,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:02:46,080 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:02:46,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:02:46,098 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2021-12-18 22:02:46,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:02:46,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-18 22:02:46,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:02:46,099 INFO L225 Difference]: With dead ends: 58 [2021-12-18 22:02:46,099 INFO L226 Difference]: Without dead ends: 58 [2021-12-18 22:02:46,100 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 22:02:46,100 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:02:46,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 96 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:02:46,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2021-12-18 22:02:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2021-12-18 22:02:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 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-18 22:02:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2021-12-18 22:02:46,104 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 7 [2021-12-18 22:02:46,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:02:46,105 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2021-12-18 22:02:46,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:02:46,105 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2021-12-18 22:02:46,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-18 22:02:46,105 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:02:46,105 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:02:46,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 22:02:46,106 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:02:46,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:02:46,106 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2021-12-18 22:02:46,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:02:46,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748622306] [2021-12-18 22:02:46,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:02:46,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:02:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:02:46,146 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-18 22:02:46,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:02:46,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748622306] [2021-12-18 22:02:46,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748622306] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:02:46,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:02:46,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 22:02:46,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894163850] [2021-12-18 22:02:46,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:02:46,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 22:02:46,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:02:46,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 22:02:46,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 22:02:46,149 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:02:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:02:46,164 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2021-12-18 22:02:46,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 22:02:46,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-18 22:02:46,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:02:46,165 INFO L225 Difference]: With dead ends: 55 [2021-12-18 22:02:46,166 INFO L226 Difference]: Without dead ends: 55 [2021-12-18 22:02:46,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 22:02:46,167 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:02:46,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:02:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-18 22:02:46,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2021-12-18 22:02:46,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:02:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2021-12-18 22:02:46,174 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 9 [2021-12-18 22:02:46,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:02:46,174 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2021-12-18 22:02:46,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:02:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2021-12-18 22:02:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-18 22:02:46,175 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:02:46,175 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:02:46,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 22:02:46,176 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:02:46,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:02:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash -763066877, now seen corresponding path program 1 times [2021-12-18 22:02:46,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:02:46,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422216132] [2021-12-18 22:02:46,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:02:46,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:02:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:02:46,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:02:46,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:02:46,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422216132] [2021-12-18 22:02:46,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422216132] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:02:46,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736018171] [2021-12-18 22:02:46,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:02:46,213 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:02:46,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:02:46,215 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-18 22:02:46,216 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-18 22:02:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:02:46,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 22:02:46,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:02:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:02:46,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:02:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:02:46,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736018171] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:02:46,421 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:02:46,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-18 22:02:46,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016067950] [2021-12-18 22:02:46,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:02:46,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 22:02:46,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:02:46,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 22:02:46,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:02:46,428 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:02:46,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:02:46,442 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2021-12-18 22:02:46,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 22:02:46,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-18 22:02:46,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:02:46,443 INFO L225 Difference]: With dead ends: 56 [2021-12-18 22:02:46,444 INFO L226 Difference]: Without dead ends: 56 [2021-12-18 22:02:46,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:02:46,445 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:02:46,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 134 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:02:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2021-12-18 22:02:46,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-12-18 22:02:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:02:46,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2021-12-18 22:02:46,448 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 14 [2021-12-18 22:02:46,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:02:46,448 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2021-12-18 22:02:46,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:02:46,449 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2021-12-18 22:02:46,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 22:02:46,449 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:02:46,449 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-18 22:02:46,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-18 22:02:46,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:02:46,667 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:02:46,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:02:46,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2021-12-18 22:02:46,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:02:46,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077166217] [2021-12-18 22:02:46,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:02:46,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:02:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:02:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:02:46,769 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:02:46,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077166217] [2021-12-18 22:02:46,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077166217] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:02:46,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533983216] [2021-12-18 22:02:46,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:02:46,770 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:02:46,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:02:46,771 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-18 22:02:46,789 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-18 22:02:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:02:46,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 22:02:46,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:02:46,877 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 22:02:46,918 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 22:02:46,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 22:02:46,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:02:46,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:02:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:02:47,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533983216] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:02:47,060 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:02:47,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2021-12-18 22:02:47,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846121567] [2021-12-18 22:02:47,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:02:47,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 22:02:47,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:02:47,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 22:02:47,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:02:47,061 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 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-18 22:02:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:02:47,137 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2021-12-18 22:02:47,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 22:02:47,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 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) Word has length 16 [2021-12-18 22:02:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:02:47,138 INFO L225 Difference]: With dead ends: 82 [2021-12-18 22:02:47,138 INFO L226 Difference]: Without dead ends: 82 [2021-12-18 22:02:47,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:02:47,139 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 76 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:02:47,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 123 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 46 Unchecked, 0.1s Time] [2021-12-18 22:02:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-18 22:02:47,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 55. [2021-12-18 22:02:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:02:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2021-12-18 22:02:47,145 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 16 [2021-12-18 22:02:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:02:47,145 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2021-12-18 22:02:47,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 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-18 22:02:47,145 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2021-12-18 22:02:47,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 22:02:47,145 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:02:47,146 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-18 22:02:47,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-18 22:02:47,359 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,SelfDestructingSolverStorable5 [2021-12-18 22:02:47,360 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:02:47,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:02:47,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2021-12-18 22:02:47,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:02:47,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684276079] [2021-12-18 22:02:47,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:02:47,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:02:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:02:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:02:47,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:02:47,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684276079] [2021-12-18 22:02:47,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684276079] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:02:47,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888947097] [2021-12-18 22:02:47,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:02:47,489 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:02:47,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:02:47,499 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-18 22:02:47,531 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-18 22:02:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:02:47,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-18 22:02:47,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:02:47,596 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 22:02:47,600 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 22:02:47,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:02:47,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-18 22:02:47,665 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:02:47,665 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 11 treesize of output 11 [2021-12-18 22:02:47,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:02:47,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:02:47,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:02:47,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888947097] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:02:47,878 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:02:47,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2021-12-18 22:02:47,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32687841] [2021-12-18 22:02:47,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:02:47,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 22:02:47,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:02:47,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 22:02:47,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-18 22:02:47,879 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 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-18 22:02:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:02:47,975 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2021-12-18 22:02:47,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 22:02:47,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 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) Word has length 16 [2021-12-18 22:02:47,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:02:47,976 INFO L225 Difference]: With dead ends: 81 [2021-12-18 22:02:47,976 INFO L226 Difference]: Without dead ends: 81 [2021-12-18 22:02:47,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-12-18 22:02:47,977 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 245 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:02:47,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 73 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 89 Invalid, 0 Unknown, 58 Unchecked, 0.1s Time] [2021-12-18 22:02:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-18 22:02:47,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 54. [2021-12-18 22:02:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 53 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:02:47,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2021-12-18 22:02:47,981 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 16 [2021-12-18 22:02:47,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:02:47,981 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2021-12-18 22:02:47,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 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-18 22:02:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2021-12-18 22:02:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-18 22:02:47,982 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:02:47,982 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:02:48,000 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-18 22:02:48,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:02:48,200 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:02:48,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:02:48,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957292, now seen corresponding path program 2 times [2021-12-18 22:02:48,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:02:48,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268473044] [2021-12-18 22:02:48,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:02:48,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:02:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:02:48,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:02:48,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:02:48,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268473044] [2021-12-18 22:02:48,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268473044] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:02:48,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318825971] [2021-12-18 22:02:48,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:02:48,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:02:48,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:02:48,240 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-18 22:02:48,241 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-18 22:02:48,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 22:02:48,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:02:48,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 22:02:48,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:02:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:02:48,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:02:48,330 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318825971] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:02:48,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 22:02:48,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-12-18 22:02:48,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590722701] [2021-12-18 22:02:48,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:02:48,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 22:02:48,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:02:48,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 22:02:48,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:02:48,332 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:02:48,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:02:48,342 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2021-12-18 22:02:48,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 22:02:48,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-18 22:02:48,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:02:48,343 INFO L225 Difference]: With dead ends: 80 [2021-12-18 22:02:48,343 INFO L226 Difference]: Without dead ends: 80 [2021-12-18 22:02:48,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:02:48,344 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 90 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:02:48,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 91 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:02:48,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-12-18 22:02:48,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 55. [2021-12-18 22:02:48,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:02:48,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2021-12-18 22:02:48,347 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 21 [2021-12-18 22:02:48,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:02:48,348 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2021-12-18 22:02:48,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:02:48,348 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2021-12-18 22:02:48,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-18 22:02:48,348 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:02:48,349 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:02:48,367 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-18 22:02:48,566 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:02:48,566 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:02:48,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:02:48,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1307957265, now seen corresponding path program 1 times [2021-12-18 22:02:48,567 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:02:48,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264728502] [2021-12-18 22:02:48,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:02:48,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:02:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:02:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:02:48,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:02:48,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264728502] [2021-12-18 22:02:48,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264728502] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:02:48,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945008928] [2021-12-18 22:02:48,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:02:48,599 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:02:48,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:02:48,611 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-18 22:02:48,612 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-18 22:02:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:02:48,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 22:02:48,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:02:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:02:48,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:02:48,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:02:48,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945008928] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:02:48,740 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:02:48,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2021-12-18 22:02:48,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104701042] [2021-12-18 22:02:48,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:02:48,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 22:02:48,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:02:48,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 22:02:48,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 22:02:48,742 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-18 22:02:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:02:48,760 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2021-12-18 22:02:48,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 22:02:48,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-18 22:02:48,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:02:48,761 INFO L225 Difference]: With dead ends: 55 [2021-12-18 22:02:48,761 INFO L226 Difference]: Without dead ends: 55 [2021-12-18 22:02:48,761 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:02:48,762 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 81 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:02:48,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 45 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:02:48,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-12-18 22:02:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2021-12-18 22:02:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.5) internal successors, (57), 54 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:02:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2021-12-18 22:02:48,765 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 21 [2021-12-18 22:02:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:02:48,765 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2021-12-18 22:02:48,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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-18 22:02:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2021-12-18 22:02:48,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 22:02:48,765 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:02:48,766 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:02:48,796 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-18 22:02:48,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:02:48,997 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:02:48,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:02:48,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822154, now seen corresponding path program 1 times [2021-12-18 22:02:48,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:02:48,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437709390] [2021-12-18 22:02:48,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:02:48,998 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:02:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:02:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:02:49,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:02:49,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437709390] [2021-12-18 22:02:49,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437709390] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:02:49,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764314143] [2021-12-18 22:02:49,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:02:49,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:02:49,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:02:49,132 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-18 22:02:49,133 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-18 22:02:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:02:49,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-18 22:02:49,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:02:49,223 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 22:02:49,242 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 22:02:49,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2021-12-18 22:02:49,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:02:49,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 22:02:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:02:49,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:03:13,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:03:13,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764314143] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:03:13,745 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:03:13,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2021-12-18 22:03:13,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443795359] [2021-12-18 22:03:13,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:03:13,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 22:03:13,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:03:13,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 22:03:13,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=142, Unknown=12, NotChecked=0, Total=210 [2021-12-18 22:03:13,750 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 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-18 22:03:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:03:13,924 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2021-12-18 22:03:13,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:03:13,924 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-18 22:03:13,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:03:13,925 INFO L225 Difference]: With dead ends: 72 [2021-12-18 22:03:13,925 INFO L226 Difference]: Without dead ends: 72 [2021-12-18 22:03:13,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=81, Invalid=179, Unknown=12, NotChecked=0, Total=272 [2021-12-18 22:03:13,926 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 296 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:03:13,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [296 Valid, 103 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 75 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2021-12-18 22:03:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-18 22:03:13,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 55. [2021-12-18 22:03:13,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 54 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2021-12-18 22:03:13,929 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 22 [2021-12-18 22:03:13,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:03:13,929 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2021-12-18 22:03:13,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 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-18 22:03:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2021-12-18 22:03:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 22:03:13,930 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:03:13,930 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:03:13,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-18 22:03:14,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:03:14,147 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:03:14,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:03:14,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2020822155, now seen corresponding path program 1 times [2021-12-18 22:03:14,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:03:14,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652799535] [2021-12-18 22:03:14,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:14,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:03:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:03:14,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:03:14,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652799535] [2021-12-18 22:03:14,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652799535] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:03:14,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083723166] [2021-12-18 22:03:14,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:14,385 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:03:14,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:03:14,386 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:03:14,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-18 22:03:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:14,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-18 22:03:14,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:03:14,480 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 22:03:14,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:03:14,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-18 22:03:14,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:03:14,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-18 22:03:14,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:03:14,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:03:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:03:14,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083723166] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:03:14,985 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:03:14,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2021-12-18 22:03:14,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451173880] [2021-12-18 22:03:14,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:03:14,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 22:03:14,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:03:14,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 22:03:14,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-12-18 22:03:14,987 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 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-18 22:03:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:03:15,119 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-12-18 22:03:15,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 22:03:15,119 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 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) Word has length 22 [2021-12-18 22:03:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:03:15,120 INFO L225 Difference]: With dead ends: 66 [2021-12-18 22:03:15,120 INFO L226 Difference]: Without dead ends: 66 [2021-12-18 22:03:15,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-12-18 22:03:15,121 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 272 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:03:15,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 37 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 76 Invalid, 0 Unknown, 4 Unchecked, 0.1s Time] [2021-12-18 22:03:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-18 22:03:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2021-12-18 22:03:15,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.358974358974359) internal successors, (53), 50 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-18 22:03:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2021-12-18 22:03:15,122 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 22 [2021-12-18 22:03:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:03:15,123 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2021-12-18 22:03:15,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.923076923076923) internal successors, (64), 14 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-18 22:03:15,123 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2021-12-18 22:03:15,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 22:03:15,123 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:03:15,123 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:03:15,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-18 22:03:15,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:03:15,335 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:03:15,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:03:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022636, now seen corresponding path program 1 times [2021-12-18 22:03:15,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:03:15,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299074516] [2021-12-18 22:03:15,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:15,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:03:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 22:03:15,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:03:15,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299074516] [2021-12-18 22:03:15,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299074516] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:03:15,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:03:15,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 22:03:15,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111264844] [2021-12-18 22:03:15,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:03:15,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 22:03:15,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:03:15,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 22:03:15,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:03:15,394 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-18 22:03:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:03:15,523 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2021-12-18 22:03:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 22:03:15,523 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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 23 [2021-12-18 22:03:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:03:15,523 INFO L225 Difference]: With dead ends: 72 [2021-12-18 22:03:15,523 INFO L226 Difference]: Without dead ends: 72 [2021-12-18 22:03:15,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-18 22:03:15,524 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 109 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:03:15,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 119 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:03:15,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-18 22:03:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2021-12-18 22:03:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.375) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2021-12-18 22:03:15,526 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 23 [2021-12-18 22:03:15,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:03:15,526 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2021-12-18 22:03:15,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-18 22:03:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2021-12-18 22:03:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 22:03:15,527 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:03:15,527 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:03:15,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 22:03:15,527 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:03:15,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:03:15,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022635, now seen corresponding path program 1 times [2021-12-18 22:03:15,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:03:15,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72918862] [2021-12-18 22:03:15,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:15,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:03:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:03:15,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:03:15,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72918862] [2021-12-18 22:03:15,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72918862] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:03:15,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:03:15,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 22:03:15,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394186642] [2021-12-18 22:03:15,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:03:15,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 22:03:15,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:03:15,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 22:03:15,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:03:15,598 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:15,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:03:15,732 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-12-18 22:03:15,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 22:03:15,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-18 22:03:15,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:03:15,733 INFO L225 Difference]: With dead ends: 66 [2021-12-18 22:03:15,733 INFO L226 Difference]: Without dead ends: 66 [2021-12-18 22:03:15,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-12-18 22:03:15,733 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 184 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:03:15,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 89 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:03:15,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-18 22:03:15,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2021-12-18 22:03:15,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.35) internal successors, (54), 51 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:15,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2021-12-18 22:03:15,735 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 23 [2021-12-18 22:03:15,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:03:15,735 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2021-12-18 22:03:15,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:15,735 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2021-12-18 22:03:15,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 22:03:15,736 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:03:15,736 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:03:15,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-18 22:03:15,736 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:03:15,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:03:15,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1033116430, now seen corresponding path program 1 times [2021-12-18 22:03:15,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:03:15,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696990689] [2021-12-18 22:03:15,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:15,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:03:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:03:15,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:03:15,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696990689] [2021-12-18 22:03:15,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696990689] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:03:15,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674518518] [2021-12-18 22:03:15,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:15,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:03:15,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:03:15,948 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:03:16,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-18 22:03:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:16,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-18 22:03:16,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:03:16,111 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 22:03:16,171 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:03:16,171 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 11 treesize of output 11 [2021-12-18 22:03:16,205 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 13 treesize of output 9 [2021-12-18 22:03:16,240 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-18 22:03:16,241 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 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 22:03:16,267 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:03:16,267 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 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-18 22:03:16,421 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 49 treesize of output 37 [2021-12-18 22:03:16,460 INFO L354 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2021-12-18 22:03:16,460 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 27 [2021-12-18 22:03:16,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:03:16,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:03:16,574 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 28 treesize of output 20 [2021-12-18 22:03:16,679 INFO L354 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2021-12-18 22:03:16,679 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 28 treesize of output 27 [2021-12-18 22:03:16,708 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_813 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_813))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2021-12-18 22:03:16,723 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_813 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_812 Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_812)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_813))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2021-12-18 22:03:16,739 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-18 22:03:16,739 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 76 treesize of output 51 [2021-12-18 22:03:16,769 INFO L354 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2021-12-18 22:03:16,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 124 [2021-12-18 22:03:16,778 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:03:16,779 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 108 treesize of output 104 [2021-12-18 22:03:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-18 22:03:16,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674518518] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:03:16,932 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:03:16,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 35 [2021-12-18 22:03:16,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431479763] [2021-12-18 22:03:16,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:03:16,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-18 22:03:16,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:03:16,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-18 22:03:16,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1027, Unknown=2, NotChecked=130, Total=1260 [2021-12-18 22:03:16,933 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:17,064 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (let ((.cse0 (select |c_#valid| .cse1))) (and (= 1 .cse0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse0 1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_813 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_812 Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_812)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_813))) (let ((.cse3 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse2 .cse3) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) is different from false [2021-12-18 22:03:17,067 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_813 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_813))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) is different from false [2021-12-18 22:03:17,070 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_813 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_813))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) is different from false [2021-12-18 22:03:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:03:17,808 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2021-12-18 22:03:17,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-18 22:03:17,809 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-18 22:03:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:03:17,810 INFO L225 Difference]: With dead ends: 129 [2021-12-18 22:03:17,810 INFO L226 Difference]: Without dead ends: 129 [2021-12-18 22:03:17,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=250, Invalid=1745, Unknown=5, NotChecked=450, Total=2450 [2021-12-18 22:03:17,811 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 143 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 22:03:17,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 851 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 969 Invalid, 0 Unknown, 383 Unchecked, 0.4s Time] [2021-12-18 22:03:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-18 22:03:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 68. [2021-12-18 22:03:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 67 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2021-12-18 22:03:17,814 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 26 [2021-12-18 22:03:17,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:03:17,814 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2021-12-18 22:03:17,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 36 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:17,814 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2021-12-18 22:03:17,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 22:03:17,814 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:03:17,815 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:03:17,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-18 22:03:18,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-18 22:03:18,015 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:03:18,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:03:18,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1033116431, now seen corresponding path program 1 times [2021-12-18 22:03:18,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:03:18,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32060688] [2021-12-18 22:03:18,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:18,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:03:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:18,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:03:18,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:03:18,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32060688] [2021-12-18 22:03:18,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32060688] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:03:18,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699832401] [2021-12-18 22:03:18,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:18,314 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:03:18,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:03:18,322 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:03:18,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-18 22:03:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:18,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 63 conjunts are in the unsatisfiable core [2021-12-18 22:03:18,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:03:18,430 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 22:03:18,533 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:03:18,534 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 11 treesize of output 11 [2021-12-18 22:03:18,570 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 13 treesize of output 9 [2021-12-18 22:03:18,575 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 13 treesize of output 9 [2021-12-18 22:03:18,616 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-18 22:03:18,616 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 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 22:03:18,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:03:18,622 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 23 treesize of output 22 [2021-12-18 22:03:18,653 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:03:18,653 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 1 case distinctions, treesize of input 54 treesize of output 53 [2021-12-18 22:03:18,658 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 41 treesize of output 41 [2021-12-18 22:03:18,881 INFO L354 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2021-12-18 22:03:18,881 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 54 [2021-12-18 22:03:18,889 INFO L354 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2021-12-18 22:03:18,889 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2021-12-18 22:03:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:03:18,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:03:19,336 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:03:19,337 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 90 treesize of output 94 [2021-12-18 22:03:19,513 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_922))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (let ((.cse3 (+ .cse5 4))) (let ((.cse0 (select (select .cse4 .cse2) .cse3))) (and (<= 0 (+ .cse0 8)) (<= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select .cse1 .cse2) .cse3))))) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) is different from false [2021-12-18 22:03:19,760 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (v_ArrVal_919 Int) (v_ArrVal_918 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6 v_ArrVal_919)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921)) (.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse6 v_ArrVal_918)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_922))) (let ((.cse1 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select (select .cse5 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (let ((.cse4 (+ .cse0 4))) (let ((.cse2 (select (select .cse5 .cse1) .cse4))) (and (<= 0 (+ .cse2 8)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select .cse3 .cse1) .cse4)) (<= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.offset|))))))))) is different from false [2021-12-18 22:03:19,775 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:03:19,780 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:03:19,780 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 243 treesize of output 188 [2021-12-18 22:03:19,783 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:03:19,786 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:03:19,786 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 183 treesize of output 113 [2021-12-18 22:03:19,818 INFO L354 Elim1Store]: treesize reduction 30, result has 67.0 percent of original size [2021-12-18 22:03:19,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 263 treesize of output 262 [2021-12-18 22:03:19,965 INFO L354 Elim1Store]: treesize reduction 156, result has 42.9 percent of original size [2021-12-18 22:03:19,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 564 treesize of output 556 [2021-12-18 22:03:20,003 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:03:20,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 456 treesize of output 438 [2021-12-18 22:03:20,033 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:03:20,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 444 treesize of output 426 [2021-12-18 22:03:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-18 22:03:23,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699832401] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:03:23,166 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:03:23,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2021-12-18 22:03:23,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326479042] [2021-12-18 22:03:23,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:03:23,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2021-12-18 22:03:23,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:03:23,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2021-12-18 22:03:23,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1372, Unknown=2, NotChecked=150, Total=1640 [2021-12-18 22:03:23,173 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 41 states, 40 states have (on average 1.875) internal successors, (75), 41 states have internal predecessors, (75), 0 states have call successors, (0), 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-18 22:03:23,371 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse11)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse11)) (.cse0 (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse10 (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= .cse0 1) (= .cse1 0) (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (v_ArrVal_919 Int) (v_ArrVal_918 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse9 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse9 v_ArrVal_919)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921)) (.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse9 v_ArrVal_918)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_922))) (let ((.cse4 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse8 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (let ((.cse7 (+ .cse3 4))) (let ((.cse5 (select (select .cse8 .cse4) .cse7))) (and (<= 0 (+ .cse5 8)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select .cse6 .cse4) .cse7)) (<= .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.offset|))))))))) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= (+ .cse1 12) (select |c_#length| .cse2)) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= 1 .cse0) (= 1 .cse10) (= .cse10 1) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)))) is different from false [2021-12-18 22:03:23,375 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (.cse8 (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse1 0) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_922))) (let ((.cse4 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (let ((.cse5 (+ .cse7 4))) (let ((.cse2 (select (select .cse6 .cse4) .cse5))) (and (<= 0 (+ .cse2 8)) (<= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select .cse3 .cse4) .cse5))))) (not (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= 1 .cse8) (= .cse8 1) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)))) is different from false [2021-12-18 22:03:23,378 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7))) (and (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_922))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (let ((.cse3 (+ .cse5 4))) (let ((.cse0 (select (select .cse4 .cse2) .cse3))) (and (<= 0 (+ .cse0 8)) (<= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (select .cse1 .cse2) .cse3))))) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse7) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse6 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)))) is different from false [2021-12-18 22:03:24,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:03:24,353 INFO L93 Difference]: Finished difference Result 173 states and 179 transitions. [2021-12-18 22:03:24,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-18 22:03:24,354 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.875) internal successors, (75), 41 states have internal predecessors, (75), 0 states have call successors, (0), 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-18 22:03:24,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:03:24,354 INFO L225 Difference]: With dead ends: 173 [2021-12-18 22:03:24,354 INFO L226 Difference]: Without dead ends: 173 [2021-12-18 22:03:24,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=285, Invalid=2382, Unknown=5, NotChecked=520, Total=3192 [2021-12-18 22:03:24,355 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 315 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 575 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 22:03:24,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 1068 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 871 Invalid, 0 Unknown, 575 Unchecked, 0.4s Time] [2021-12-18 22:03:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-18 22:03:24,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 68. [2021-12-18 22:03:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2021-12-18 22:03:24,357 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 26 [2021-12-18 22:03:24,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:03:24,358 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2021-12-18 22:03:24,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.875) internal successors, (75), 41 states have internal predecessors, (75), 0 states have call successors, (0), 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-18 22:03:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2021-12-18 22:03:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-18 22:03:24,358 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:03:24,358 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:03:24,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-18 22:03:24,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-18 22:03:24,560 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:03:24,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:03:24,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1961843294, now seen corresponding path program 1 times [2021-12-18 22:03:24,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:03:24,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625471182] [2021-12-18 22:03:24,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:24,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:03:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:24,639 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:03:24,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:03:24,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625471182] [2021-12-18 22:03:24,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625471182] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:03:24,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:03:24,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 22:03:24,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663085317] [2021-12-18 22:03:24,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:03:24,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 22:03:24,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:03:24,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 22:03:24,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:03:24,642 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 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-18 22:03:24,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:03:24,743 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2021-12-18 22:03:24,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 22:03:24,743 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-18 22:03:24,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:03:24,744 INFO L225 Difference]: With dead ends: 81 [2021-12-18 22:03:24,744 INFO L226 Difference]: Without dead ends: 81 [2021-12-18 22:03:24,744 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-12-18 22:03:24,745 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 182 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:03:24,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 106 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:03:24,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-18 22:03:24,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2021-12-18 22:03:24,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 72 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:24,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2021-12-18 22:03:24,746 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 27 [2021-12-18 22:03:24,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:03:24,747 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2021-12-18 22:03:24,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 8 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-18 22:03:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2021-12-18 22:03:24,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-18 22:03:24,747 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:03:24,747 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:03:24,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-18 22:03:24,747 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:03:24,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:03:24,748 INFO L85 PathProgramCache]: Analyzing trace with hash 687600079, now seen corresponding path program 1 times [2021-12-18 22:03:24,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:03:24,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366890360] [2021-12-18 22:03:24,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:24,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:03:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:24,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:03:24,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:03:24,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366890360] [2021-12-18 22:03:24,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366890360] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:03:24,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:03:24,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 22:03:24,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024237353] [2021-12-18 22:03:24,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:03:24,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 22:03:24,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:03:24,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 22:03:24,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:03:24,815 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:24,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:03:24,944 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2021-12-18 22:03:24,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 22:03:24,945 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-18 22:03:24,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:03:24,945 INFO L225 Difference]: With dead ends: 82 [2021-12-18 22:03:24,945 INFO L226 Difference]: Without dead ends: 82 [2021-12-18 22:03:24,946 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-12-18 22:03:24,946 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 164 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:03:24,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 85 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:03:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-18 22:03:24,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2021-12-18 22:03:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.296875) internal successors, (83), 75 states have internal predecessors, (83), 0 states have call successors, (0), 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-18 22:03:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2021-12-18 22:03:24,948 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 28 [2021-12-18 22:03:24,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:03:24,948 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2021-12-18 22:03:24,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:24,948 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2021-12-18 22:03:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-18 22:03:24,949 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:03:24,949 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:03:24,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-18 22:03:24,949 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:03:24,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:03:24,949 INFO L85 PathProgramCache]: Analyzing trace with hash -164034179, now seen corresponding path program 1 times [2021-12-18 22:03:24,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:03:24,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881237622] [2021-12-18 22:03:24,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:24,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:03:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:25,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:03:25,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:03:25,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881237622] [2021-12-18 22:03:25,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881237622] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:03:25,117 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:03:25,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 22:03:25,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394394935] [2021-12-18 22:03:25,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:03:25,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 22:03:25,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:03:25,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 22:03:25,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-12-18 22:03:25,118 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 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-18 22:03:25,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:03:25,295 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2021-12-18 22:03:25,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 22:03:25,296 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 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) Word has length 29 [2021-12-18 22:03:25,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:03:25,296 INFO L225 Difference]: With dead ends: 83 [2021-12-18 22:03:25,296 INFO L226 Difference]: Without dead ends: 83 [2021-12-18 22:03:25,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2021-12-18 22:03:25,297 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 185 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:03:25,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 93 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:03:25,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-18 22:03:25,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2021-12-18 22:03:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 73 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:25,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2021-12-18 22:03:25,299 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 29 [2021-12-18 22:03:25,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:03:25,299 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2021-12-18 22:03:25,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 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-18 22:03:25,299 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2021-12-18 22:03:25,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-18 22:03:25,300 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:03:25,300 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:03:25,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-18 22:03:25,300 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:03:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:03:25,300 INFO L85 PathProgramCache]: Analyzing trace with hash -159233920, now seen corresponding path program 1 times [2021-12-18 22:03:25,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:03:25,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554093772] [2021-12-18 22:03:25,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:25,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:03:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:03:25,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:03:25,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554093772] [2021-12-18 22:03:25,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554093772] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:03:25,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:03:25,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 22:03:25,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828021827] [2021-12-18 22:03:25,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:03:25,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 22:03:25,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:03:25,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 22:03:25,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:03:25,347 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:25,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:03:25,399 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2021-12-18 22:03:25,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:03:25,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-18 22:03:25,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:03:25,400 INFO L225 Difference]: With dead ends: 83 [2021-12-18 22:03:25,400 INFO L226 Difference]: Without dead ends: 83 [2021-12-18 22:03:25,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 22:03:25,401 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 13 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:03:25,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 91 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:03:25,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2021-12-18 22:03:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2021-12-18 22:03:25,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 80 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:25,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2021-12-18 22:03:25,403 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 29 [2021-12-18 22:03:25,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:03:25,403 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2021-12-18 22:03:25,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2021-12-18 22:03:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 22:03:25,404 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:03:25,404 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:03:25,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-18 22:03:25,404 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:03:25,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:03:25,405 INFO L85 PathProgramCache]: Analyzing trace with hash -790092142, now seen corresponding path program 1 times [2021-12-18 22:03:25,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:03:25,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692969524] [2021-12-18 22:03:25,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:25,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:03:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-18 22:03:25,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:03:25,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692969524] [2021-12-18 22:03:25,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692969524] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:03:25,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:03:25,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 22:03:25,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350281934] [2021-12-18 22:03:25,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:03:25,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 22:03:25,563 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:03:25,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 22:03:25,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-18 22:03:25,564 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:25,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:03:25,812 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2021-12-18 22:03:25,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 22:03:25,813 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-18 22:03:25,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:03:25,813 INFO L225 Difference]: With dead ends: 85 [2021-12-18 22:03:25,813 INFO L226 Difference]: Without dead ends: 85 [2021-12-18 22:03:25,813 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2021-12-18 22:03:25,814 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 116 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:03:25,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 144 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:03:25,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-12-18 22:03:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2021-12-18 22:03:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 77 states have internal predecessors, (87), 0 states have call successors, (0), 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-18 22:03:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2021-12-18 22:03:25,816 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 30 [2021-12-18 22:03:25,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:03:25,816 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2021-12-18 22:03:25,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:25,816 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2021-12-18 22:03:25,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 22:03:25,816 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:03:25,817 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:03:25,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-18 22:03:25,817 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:03:25,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:03:25,817 INFO L85 PathProgramCache]: Analyzing trace with hash -641284110, now seen corresponding path program 1 times [2021-12-18 22:03:25,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:03:25,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833223718] [2021-12-18 22:03:25,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:25,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:03:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:25,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:03:25,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:03:25,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833223718] [2021-12-18 22:03:25,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833223718] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:03:25,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549055466] [2021-12-18 22:03:25,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:25,924 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:03:25,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:03:25,925 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:03:25,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-18 22:03:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:26,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 22:03:26,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:03:26,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:03:26,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-18 22:03:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:03:26,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:03:26,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549055466] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:03:26,202 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 22:03:26,202 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2021-12-18 22:03:26,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855102476] [2021-12-18 22:03:26,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:03:26,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 22:03:26,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:03:26,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 22:03:26,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-12-18 22:03:26,204 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:03:26,300 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2021-12-18 22:03:26,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 22:03:26,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-18 22:03:26,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:03:26,301 INFO L225 Difference]: With dead ends: 77 [2021-12-18 22:03:26,301 INFO L226 Difference]: Without dead ends: 77 [2021-12-18 22:03:26,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-12-18 22:03:26,302 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 76 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 22:03:26,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 54 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 22:03:26,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-18 22:03:26,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-12-18 22:03:26,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.303030303030303) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:26,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2021-12-18 22:03:26,304 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 30 [2021-12-18 22:03:26,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:03:26,304 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2021-12-18 22:03:26,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:26,304 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2021-12-18 22:03:26,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-18 22:03:26,304 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:03:26,304 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:03:26,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-18 22:03:26,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-18 22:03:26,505 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:03:26,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:03:26,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1691393914, now seen corresponding path program 2 times [2021-12-18 22:03:26,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:03:26,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024066152] [2021-12-18 22:03:26,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:26,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:03:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:03:26,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:03:26,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024066152] [2021-12-18 22:03:26,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024066152] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:03:26,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756133807] [2021-12-18 22:03:26,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 22:03:26,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:03:26,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:03:26,584 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:03:26,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-18 22:03:26,703 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 22:03:26,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 22:03:26,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 22:03:26,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:03:26,766 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:03:26,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 22:03:26,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756133807] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:03:26,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 22:03:26,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2021-12-18 22:03:26,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598929900] [2021-12-18 22:03:26,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:03:26,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 22:03:26,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:03:26,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 22:03:26,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:03:26,768 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:26,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:03:26,775 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2021-12-18 22:03:26,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 22:03:26,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-18 22:03:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:03:26,777 INFO L225 Difference]: With dead ends: 61 [2021-12-18 22:03:26,777 INFO L226 Difference]: Without dead ends: 61 [2021-12-18 22:03:26,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:03:26,778 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 98 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:03:26,778 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 56 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:03:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-18 22:03:26,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2021-12-18 22:03:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 50 states have (on average 1.3) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:26,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2021-12-18 22:03:26,780 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 34 [2021-12-18 22:03:26,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:03:26,780 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2021-12-18 22:03:26,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:26,780 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2021-12-18 22:03:26,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-18 22:03:26,781 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:03:26,781 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:03:26,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-18 22:03:26,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-18 22:03:26,995 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:03:26,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:03:26,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2005413734, now seen corresponding path program 1 times [2021-12-18 22:03:26,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:03:26,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744194962] [2021-12-18 22:03:26,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:26,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:03:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:03:27,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:03:27,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744194962] [2021-12-18 22:03:27,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744194962] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 22:03:27,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 22:03:27,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 22:03:27,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581374482] [2021-12-18 22:03:27,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 22:03:27,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 22:03:27,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:03:27,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 22:03:27,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 22:03:27,053 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:27,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:03:27,104 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2021-12-18 22:03:27,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 22:03:27,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-18 22:03:27,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:03:27,105 INFO L225 Difference]: With dead ends: 59 [2021-12-18 22:03:27,105 INFO L226 Difference]: Without dead ends: 59 [2021-12-18 22:03:27,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 22:03:27,106 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:03:27,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 31 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:03:27,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-18 22:03:27,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-12-18 22:03:27,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.26) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2021-12-18 22:03:27,112 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 34 [2021-12-18 22:03:27,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:03:27,112 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2021-12-18 22:03:27,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2021-12-18 22:03:27,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-18 22:03:27,113 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:03:27,113 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:03:27,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-18 22:03:27,114 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:03:27,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:03:27,114 INFO L85 PathProgramCache]: Analyzing trace with hash -2038282743, now seen corresponding path program 1 times [2021-12-18 22:03:27,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:03:27,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474267755] [2021-12-18 22:03:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:27,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:03:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:27,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:03:27,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:03:27,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474267755] [2021-12-18 22:03:27,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474267755] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:03:27,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96371401] [2021-12-18 22:03:27,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:27,378 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:03:27,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:03:27,396 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:03:27,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-18 22:03:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:27,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 55 conjunts are in the unsatisfiable core [2021-12-18 22:03:27,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:03:27,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 22:03:27,626 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:03:27,626 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 22:03:27,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 22:03:27,698 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 19 treesize of output 18 [2021-12-18 22:03:27,736 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:03:27,736 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 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-18 22:03:28,015 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 25 treesize of output 17 [2021-12-18 22:03:28,028 INFO L354 Elim1Store]: treesize reduction 6, result has 76.0 percent of original size [2021-12-18 22:03:28,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 33 [2021-12-18 22:03:28,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:03:28,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:03:28,112 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 27 treesize of output 19 [2021-12-18 22:03:28,231 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1592 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1592))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) 4) 0)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2021-12-18 22:03:28,244 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1590 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1592 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1590)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1592))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= (select (select .cse1 .cse0) 4) 0)))))) is different from false [2021-12-18 22:03:28,258 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-18 22:03:28,259 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 75 treesize of output 50 [2021-12-18 22:03:28,295 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:03:28,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 158 [2021-12-18 22:03:28,305 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:03:28,305 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 113 treesize of output 105 [2021-12-18 22:03:29,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-18 22:03:29,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96371401] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:03:29,616 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:03:29,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 17] total 43 [2021-12-18 22:03:29,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912925839] [2021-12-18 22:03:29,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:03:29,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-18 22:03:29,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:03:29,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-18 22:03:29,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1499, Unknown=2, NotChecked=158, Total=1806 [2021-12-18 22:03:29,617 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 43 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 43 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:29,786 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_1590 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1592 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1590)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1592))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= (select (select .cse1 .cse0) 4) 0)))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse2 1) (not (= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= 1 .cse2) (= 1 .cse3) (= .cse3 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|))) is different from false [2021-12-18 22:03:29,789 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse0 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= 1 .cse1) (= (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse1 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1592 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1592))) (let ((.cse3 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse2 .cse3) 4) 0)) (not (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (not (= 0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) is different from false [2021-12-18 22:03:29,791 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select .cse0 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_1592 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1592))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse1 .cse2) 4) 0)) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (not (= (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0)))) is different from false [2021-12-18 22:03:30,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:03:30,403 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2021-12-18 22:03:30,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-18 22:03:30,403 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 43 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-18 22:03:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:03:30,403 INFO L225 Difference]: With dead ends: 61 [2021-12-18 22:03:30,403 INFO L226 Difference]: Without dead ends: 59 [2021-12-18 22:03:30,404 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=390, Invalid=2705, Unknown=5, NotChecked=560, Total=3660 [2021-12-18 22:03:30,405 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 124 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:03:30,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 496 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 448 Invalid, 0 Unknown, 223 Unchecked, 0.2s Time] [2021-12-18 22:03:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-12-18 22:03:30,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-12-18 22:03:30,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.24) internal successors, (62), 58 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-18 22:03:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2021-12-18 22:03:30,406 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 35 [2021-12-18 22:03:30,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:03:30,406 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2021-12-18 22:03:30,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 43 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:30,406 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2021-12-18 22:03:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 22:03:30,407 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:03:30,407 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:03:30,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-18 22:03:30,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-18 22:03:30,615 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:03:30,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:03:30,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1598435685, now seen corresponding path program 1 times [2021-12-18 22:03:30,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:03:30,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637871496] [2021-12-18 22:03:30,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:30,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:03:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:31,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:03:31,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:03:31,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637871496] [2021-12-18 22:03:31,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637871496] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:03:31,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868549044] [2021-12-18 22:03:31,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:31,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:03:31,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:03:31,047 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:03:31,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-18 22:03:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:31,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 71 conjunts are in the unsatisfiable core [2021-12-18 22:03:31,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:03:31,233 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 22:03:31,302 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:03:31,303 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 11 treesize of output 11 [2021-12-18 22:03:31,336 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 13 treesize of output 9 [2021-12-18 22:03:31,371 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-18 22:03:31,372 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 1 case distinctions, treesize of input 23 treesize of output 22 [2021-12-18 22:03:31,392 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 22:03:31,392 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 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-18 22:03:31,544 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2021-12-18 22:03:31,731 INFO L354 Elim1Store]: treesize reduction 64, result has 22.0 percent of original size [2021-12-18 22:03:31,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 50 [2021-12-18 22:03:31,744 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2021-12-18 22:03:31,990 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-18 22:03:31,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2021-12-18 22:03:32,100 INFO L354 Elim1Store]: treesize reduction 66, result has 46.3 percent of original size [2021-12-18 22:03:32,101 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 101 [2021-12-18 22:03:34,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:03:34,049 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:03:34,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 77 [2021-12-18 22:03:34,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:03:34,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:03:34,328 INFO L354 Elim1Store]: treesize reduction 13, result has 78.7 percent of original size [2021-12-18 22:03:34,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 99 [2021-12-18 22:03:34,692 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_main_~#s~0#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_1723 (Array Int Int))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1723) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2021-12-18 22:03:34,699 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 65 treesize of output 49 [2021-12-18 22:03:34,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1723 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_#res#1.base|)) (not (= .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1723) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.base| .cse1))))) is different from false [2021-12-18 22:03:34,723 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1723 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse1) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)))) (or (not (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1723) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.base| .cse0))))) is different from false [2021-12-18 22:03:34,744 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1723 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1723) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.base| .cse1))))) is different from false [2021-12-18 22:03:34,761 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1721 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1721))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select .cse1 .cse2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (or (not (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1723) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.base| .cse0) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) is different from false [2021-12-18 22:03:34,787 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1721 (Array Int Int)) (v_ArrVal_1719 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1719)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1721))) (let ((.cse0 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse2 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.base| .cse1) (not (= .cse1 (select (select (store .cse2 .cse1 v_ArrVal_1723) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2021-12-18 22:03:34,804 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-18 22:03:34,804 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 197 treesize of output 97 [2021-12-18 22:03:34,824 INFO L354 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2021-12-18 22:03:34,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 897 treesize of output 659 [2021-12-18 22:03:34,841 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:03:34,841 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 534 treesize of output 462 [2021-12-18 22:03:34,846 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 394 treesize of output 382 [2021-12-18 22:03:34,991 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2021-12-18 22:03:34,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868549044] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:03:34,991 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:03:34,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 56 [2021-12-18 22:03:34,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153041309] [2021-12-18 22:03:34,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:03:34,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2021-12-18 22:03:34,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:03:34,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2021-12-18 22:03:34,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2338, Unknown=48, NotChecked=618, Total=3192 [2021-12-18 22:03:34,993 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 57 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 57 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:35,174 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1721 (Array Int Int)) (v_ArrVal_1719 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8) v_ArrVal_1719)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1721))) (let ((.cse0 (select (select .cse2 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse2 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |ULTIMATE.start_main_~#s~0#1.base| .cse1) (not (= .cse1 (select (select (store .cse2 .cse1 v_ArrVal_1723) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2021-12-18 22:03:35,177 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (forall ((v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1721 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1721))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select .cse1 .cse2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (or (not (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1723) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.base| .cse0) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from false [2021-12-18 22:03:35,180 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|) (forall ((v_ArrVal_1723 (Array Int Int)) (v_ArrVal_1721 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1721))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select .cse1 .cse2) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) (or (not (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1723) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.base| .cse0) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) is different from false [2021-12-18 22:03:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:03:35,727 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2021-12-18 22:03:35,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-18 22:03:35,728 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 57 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-18 22:03:35,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:03:35,728 INFO L225 Difference]: With dead ends: 68 [2021-12-18 22:03:35,728 INFO L226 Difference]: Without dead ends: 68 [2021-12-18 22:03:35,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=336, Invalid=3430, Unknown=52, NotChecked=1152, Total=4970 [2021-12-18 22:03:35,730 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 76 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 315 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:03:35,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 515 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 468 Invalid, 0 Unknown, 315 Unchecked, 0.2s Time] [2021-12-18 22:03:35,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-18 22:03:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2021-12-18 22:03:35,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:35,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2021-12-18 22:03:35,733 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 36 [2021-12-18 22:03:35,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:03:35,733 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2021-12-18 22:03:35,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 57 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:35,733 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2021-12-18 22:03:35,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 22:03:35,733 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:03:35,733 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:03:35,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-18 22:03:35,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-18 22:03:35,943 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:03:35,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:03:35,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1598435684, now seen corresponding path program 1 times [2021-12-18 22:03:35,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:03:35,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186190110] [2021-12-18 22:03:35,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:35,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:03:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:03:36,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:03:36,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186190110] [2021-12-18 22:03:36,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186190110] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:03:36,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059757128] [2021-12-18 22:03:36,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:36,202 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:03:36,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:03:36,203 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:03:36,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-18 22:03:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:36,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 81 conjunts are in the unsatisfiable core [2021-12-18 22:03:36,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:03:36,360 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 22:03:36,436 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:03:36,436 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 11 treesize of output 11 [2021-12-18 22:03:36,479 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 13 treesize of output 9 [2021-12-18 22:03:36,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:03:36,509 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 23 treesize of output 22 [2021-12-18 22:03:36,552 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 25 treesize of output 25 [2021-12-18 22:03:36,882 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 22:03:36,882 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 60 [2021-12-18 22:03:36,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:03:36,889 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Unexpected substitution problem. [2021-12-18 22:03:36,889 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-18 22:03:36,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2021-12-18 22:03:36,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533246154] [2021-12-18 22:03:36,889 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-18 22:03:36,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-18 22:03:36,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:03:36,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-18 22:03:36,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=959, Unknown=0, NotChecked=0, Total=1056 [2021-12-18 22:03:36,891 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:37,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:03:37,397 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2021-12-18 22:03:37,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-18 22:03:37,399 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-18 22:03:37,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:03:37,399 INFO L225 Difference]: With dead ends: 92 [2021-12-18 22:03:37,399 INFO L226 Difference]: Without dead ends: 92 [2021-12-18 22:03:37,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=293, Invalid=2157, Unknown=0, NotChecked=0, Total=2450 [2021-12-18 22:03:37,400 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 260 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 22:03:37,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 342 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 22:03:37,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-12-18 22:03:37,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 66. [2021-12-18 22:03:37,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 65 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2021-12-18 22:03:37,402 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 36 [2021-12-18 22:03:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:03:37,402 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2021-12-18 22:03:37,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:37,403 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2021-12-18 22:03:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-18 22:03:37,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:03:37,403 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:03:37,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-18 22:03:37,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:03:37,604 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:03:37,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:03:37,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1988076587, now seen corresponding path program 1 times [2021-12-18 22:03:37,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:03:37,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065579488] [2021-12-18 22:03:37,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:37,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:03:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:37,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 22:03:37,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:03:37,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065579488] [2021-12-18 22:03:37,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065579488] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:03:37,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479089591] [2021-12-18 22:03:37,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:37,664 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:03:37,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:03:37,676 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:03:37,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-18 22:03:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:37,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 22:03:37,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:03:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:03:37,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:03:37,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-18 22:03:37,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479089591] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 22:03:37,881 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 22:03:37,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2021-12-18 22:03:37,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990658066] [2021-12-18 22:03:37,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 22:03:37,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 22:03:37,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 22:03:37,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 22:03:37,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 22:03:37,883 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:37,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 22:03:37,907 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2021-12-18 22:03:37,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 22:03:37,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-18 22:03:37,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 22:03:37,908 INFO L225 Difference]: With dead ends: 66 [2021-12-18 22:03:37,908 INFO L226 Difference]: Without dead ends: 66 [2021-12-18 22:03:37,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-18 22:03:37,909 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 72 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 22:03:37,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 103 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 22:03:37,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-12-18 22:03:37,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-12-18 22:03:37,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:37,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2021-12-18 22:03:37,911 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 37 [2021-12-18 22:03:37,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 22:03:37,911 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2021-12-18 22:03:37,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 22:03:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2021-12-18 22:03:37,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-18 22:03:37,911 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 22:03:37,911 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 22:03:37,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-18 22:03:38,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-18 22:03:38,128 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2021-12-18 22:03:38,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 22:03:38,129 INFO L85 PathProgramCache]: Analyzing trace with hash -695048217, now seen corresponding path program 1 times [2021-12-18 22:03:38,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 22:03:38,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620435897] [2021-12-18 22:03:38,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:38,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 22:03:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:03:39,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 22:03:39,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620435897] [2021-12-18 22:03:39,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620435897] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 22:03:39,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278773892] [2021-12-18 22:03:39,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 22:03:39,271 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 22:03:39,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 22:03:39,272 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 22:03:39,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-18 22:03:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 22:03:39,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 128 conjunts are in the unsatisfiable core [2021-12-18 22:03:39,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 22:03:39,433 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 22:03:39,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:03:39,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-18 22:03:39,487 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 22:03:39,546 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 13 treesize of output 9 [2021-12-18 22:03:39,552 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 13 treesize of output 9 [2021-12-18 22:03:39,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:03:39,623 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 23 treesize of output 22 [2021-12-18 22:03:39,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:03:39,631 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 23 treesize of output 22 [2021-12-18 22:03:39,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:03:39,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2021-12-18 22:03:39,735 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 22:03:39,736 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 11 treesize of output 11 [2021-12-18 22:03:39,819 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-18 22:03:39,828 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-18 22:03:39,849 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 21 treesize of output 20 [2021-12-18 22:03:39,861 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 21 treesize of output 20 [2021-12-18 22:03:39,938 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-18 22:03:39,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-18 22:03:40,062 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:03:40,070 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-18 22:03:40,071 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 77 [2021-12-18 22:03:40,081 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-12-18 22:03:40,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 64 [2021-12-18 22:03:41,010 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:03:41,010 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 13 treesize of output 17 [2021-12-18 22:03:41,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:03:41,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:03:41,146 INFO L354 Elim1Store]: treesize reduction 224, result has 34.3 percent of original size [2021-12-18 22:03:41,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 168 treesize of output 195 [2021-12-18 22:03:41,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:03:41,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:03:41,228 INFO L354 Elim1Store]: treesize reduction 100, result has 47.9 percent of original size [2021-12-18 22:03:41,228 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 83 treesize of output 141 [2021-12-18 22:03:55,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:03:55,965 INFO L354 Elim1Store]: treesize reduction 296, result has 6.0 percent of original size [2021-12-18 22:03:55,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 4 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 35 case distinctions, treesize of input 183 treesize of output 157 [2021-12-18 22:03:55,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:03:55,989 INFO L354 Elim1Store]: treesize reduction 179, result has 6.8 percent of original size [2021-12-18 22:03:55,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 199 treesize of output 205 [2021-12-18 22:03:59,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:03:59,993 INFO L354 Elim1Store]: treesize reduction 73, result has 9.9 percent of original size [2021-12-18 22:03:59,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 112 treesize of output 71 [2021-12-18 22:03:59,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:04:00,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 22:04:00,006 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 22:04:00,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 24 [2021-12-18 22:04:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 22:04:00,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 22:04:06,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:04:07,007 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:04:07,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 3645 treesize of output 2801 [2021-12-18 22:04:07,065 INFO L354 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-12-18 22:04:07,065 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 2 case distinctions, treesize of input 2845 treesize of output 1941 [2021-12-18 22:04:18,239 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_6 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_2135 Int) (v_ArrVal_2128 Int)) (let ((.cse22 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse18 (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_6))) (store .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse22 v_ArrVal_2128)))) (.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_7))) (store .cse21 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse21 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse16 (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse19 (+ (select (select .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse2 (select (select .cse20 .cse16) .cse19)) (.cse1 (select (select .cse18 .cse16) .cse19))) (let ((.cse14 (store .cse18 .cse2 (store (select .cse18 .cse2) (+ .cse1 8) v_ArrVal_2135)))) (let ((.cse3 (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse15 (+ .cse1 4)) (.cse17 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 8))) (or (not (= (select v_arrayElimArr_7 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (and (= .cse1 0) (= .cse2 0)) (not (= 0 (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_2133 Int)) (= (let ((.cse12 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (let ((.cse10 (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_6))) (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse12 v_ArrVal_2128)))) (.cse6 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_7))) (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))) (let ((.cse8 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (+ (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse7 (select (select .cse10 .cse8) .cse9))) (select (let ((.cse5 (select (select .cse6 .cse8) .cse9))) (select (let ((.cse4 (store .cse6 .cse5 (store (select .cse6 .cse5) (+ .cse7 8) v_ArrVal_2133)))) (store .cse4 |c_ULTIMATE.start_main_~#s~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset| .cse5))) .cse5)) (+ .cse7 4)))))) 0)) (= (select (select (store .cse14 |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset| .cse1)) .cse2) .cse15) 0)) (not (= (select v_arrayElimArr_6 .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.offset|)) (< (select |c_#length| .cse2) (+ .cse1 12)) (< .cse15 0) (not (= .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= (select v_arrayElimArr_7 .cse17) 0)) (not (= (select v_arrayElimArr_6 .cse17) 0)))))))))) is different from false [2021-12-18 22:05:43,550 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:05:43,587 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:05:43,588 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 4880 treesize of output 3610 [2021-12-18 22:05:43,602 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 22:05:43,629 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 22:05:43,629 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 3668 treesize of output 2308 [2021-12-18 22:06:45,739 WARN L227 SmtUtils]: Spent 58.56s on a formula simplification. DAG size of input: 124 DAG size of output: 96 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-18 22:06:45,740 INFO L354 Elim1Store]: treesize reduction 366, result has 63.0 percent of original size [2021-12-18 22:06:45,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 2143979 treesize of output 1669958 Killed by 15