./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version ae007674 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/sll2n_update_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 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 06:04:01,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 06:04:01,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 06:04:01,361 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 06:04:01,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 06:04:01,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 06:04:01,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 06:04:01,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 06:04:01,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 06:04:01,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 06:04:01,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 06:04:01,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 06:04:01,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 06:04:01,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 06:04:01,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 06:04:01,383 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 06:04:01,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 06:04:01,384 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 06:04:01,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 06:04:01,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 06:04:01,392 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 06:04:01,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 06:04:01,393 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 06:04:01,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 06:04:01,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 06:04:01,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 06:04:01,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 06:04:01,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 06:04:01,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 06:04:01,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 06:04:01,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 06:04:01,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 06:04:01,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 06:04:01,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 06:04:01,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 06:04:01,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 06:04:01,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 06:04:01,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 06:04:01,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 06:04:01,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 06:04:01,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 06:04:01,411 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-28 06:04:01,437 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 06:04:01,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 06:04:01,439 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 06:04:01,439 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 06:04:01,439 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 06:04:01,440 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 06:04:01,440 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 06:04:01,441 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 06:04:01,441 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 06:04:01,441 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 06:04:01,442 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 06:04:01,442 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 06:04:01,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 06:04:01,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 06:04:01,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 06:04:01,442 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-28 06:04:01,443 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-28 06:04:01,443 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-28 06:04:01,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 06:04:01,443 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-28 06:04:01,443 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 06:04:01,443 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 06:04:01,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 06:04:01,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 06:04:01,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 06:04:01,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 06:04:01,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 06:04:01,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 06:04:01,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 06:04:01,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 06:04:01,445 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 -> 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a [2021-12-28 06:04:01,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 06:04:01,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 06:04:01,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 06:04:01,712 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 06:04:01,713 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 06:04:01,714 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all.i [2021-12-28 06:04:01,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5925c4371/0a2f250babb249619bbd51ef582b58cf/FLAGa0361185b [2021-12-28 06:04:02,116 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 06:04:02,116 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all.i [2021-12-28 06:04:02,123 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5925c4371/0a2f250babb249619bbd51ef582b58cf/FLAGa0361185b [2021-12-28 06:04:02,519 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5925c4371/0a2f250babb249619bbd51ef582b58cf [2021-12-28 06:04:02,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 06:04:02,522 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 06:04:02,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 06:04:02,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 06:04:02,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 06:04:02,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 06:04:02" (1/1) ... [2021-12-28 06:04:02,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df8940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:02, skipping insertion in model container [2021-12-28 06:04:02,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 06:04:02" (1/1) ... [2021-12-28 06:04:02,545 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 06:04:02,577 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 06:04:02,863 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/sll2n_update_all.i[24218,24231] [2021-12-28 06:04:02,865 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 06:04:02,879 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 06:04:02,932 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/sll2n_update_all.i[24218,24231] [2021-12-28 06:04:02,933 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 06:04:02,968 INFO L208 MainTranslator]: Completed translation [2021-12-28 06:04:02,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:02 WrapperNode [2021-12-28 06:04:02,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 06:04:02,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 06:04:02,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 06:04:02,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 06:04:02,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:02" (1/1) ... [2021-12-28 06:04:03,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:02" (1/1) ... [2021-12-28 06:04:03,038 INFO L137 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2021-12-28 06:04:03,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 06:04:03,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 06:04:03,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 06:04:03,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 06:04:03,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:02" (1/1) ... [2021-12-28 06:04:03,049 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:02" (1/1) ... [2021-12-28 06:04:03,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:02" (1/1) ... [2021-12-28 06:04:03,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:02" (1/1) ... [2021-12-28 06:04:03,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:02" (1/1) ... [2021-12-28 06:04:03,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:02" (1/1) ... [2021-12-28 06:04:03,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:02" (1/1) ... [2021-12-28 06:04:03,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 06:04:03,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 06:04:03,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 06:04:03,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 06:04:03,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:02" (1/1) ... [2021-12-28 06:04:03,099 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 06:04:03,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:04:03,146 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-28 06:04:03,170 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-28 06:04:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 06:04:03,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 06:04:03,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 06:04:03,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 06:04:03,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 06:04:03,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 06:04:03,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 06:04:03,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 06:04:03,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 06:04:03,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 06:04:03,343 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 06:04:03,344 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 06:04:03,528 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 06:04:03,535 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 06:04:03,535 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-28 06:04:03,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 06:04:03 BoogieIcfgContainer [2021-12-28 06:04:03,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 06:04:03,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 06:04:03,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 06:04:03,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 06:04:03,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 06:04:02" (1/3) ... [2021-12-28 06:04:03,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4b559f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 06:04:03, skipping insertion in model container [2021-12-28 06:04:03,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 06:04:02" (2/3) ... [2021-12-28 06:04:03,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f4b559f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 06:04:03, skipping insertion in model container [2021-12-28 06:04:03,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 06:04:03" (3/3) ... [2021-12-28 06:04:03,547 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2021-12-28 06:04:03,551 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 06:04:03,552 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-12-28 06:04:03,590 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 06:04:03,598 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-28 06:04:03,598 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-12-28 06:04:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:03,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 06:04:03,631 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:03,632 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 06:04:03,633 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:03,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:03,638 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2021-12-28 06:04:03,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:03,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91467388] [2021-12-28 06:04:03,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:03,649 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:03,841 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-28 06:04:03,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:03,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91467388] [2021-12-28 06:04:03,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91467388] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:03,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:04:03,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 06:04:03,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119518017] [2021-12-28 06:04:03,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:03,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:04:03,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:03,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:04:03,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:04:03,878 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-28 06:04:03,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:03,985 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2021-12-28 06:04:03,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:04:03,987 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-28 06:04:03,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:03,994 INFO L225 Difference]: With dead ends: 109 [2021-12-28 06:04:03,995 INFO L226 Difference]: Without dead ends: 104 [2021-12-28 06:04:03,996 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-28 06:04:04,001 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 63 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:04,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:04:04,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-28 06:04:04,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2021-12-28 06:04:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.6) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2021-12-28 06:04:04,037 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2021-12-28 06:04:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:04,037 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2021-12-28 06:04:04,037 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-28 06:04:04,038 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2021-12-28 06:04:04,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-28 06:04:04,038 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:04,038 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-28 06:04:04,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 06:04:04,039 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:04,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:04,040 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2021-12-28 06:04:04,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:04,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477285868] [2021-12-28 06:04:04,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:04,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:04,095 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-28 06:04:04,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:04,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477285868] [2021-12-28 06:04:04,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477285868] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:04,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:04:04,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 06:04:04,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142752320] [2021-12-28 06:04:04,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:04,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:04:04,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:04,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:04:04,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:04:04,101 INFO L87 Difference]: Start difference. First operand 59 states and 64 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-28 06:04:04,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:04,180 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2021-12-28 06:04:04,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:04:04,180 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-28 06:04:04,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:04,182 INFO L225 Difference]: With dead ends: 102 [2021-12-28 06:04:04,183 INFO L226 Difference]: Without dead ends: 102 [2021-12-28 06:04:04,184 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-28 06:04:04,185 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:04,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:04:04,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-28 06:04:04,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 57. [2021-12-28 06:04:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.55) internal successors, (62), 56 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-28 06:04:04,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-12-28 06:04:04,193 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 5 [2021-12-28 06:04:04,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:04,194 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-12-28 06:04:04,194 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-28 06:04:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2021-12-28 06:04:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-28 06:04:04,196 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:04,197 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:04,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 06:04:04,197 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:04,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:04,198 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2021-12-28 06:04:04,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:04,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345662010] [2021-12-28 06:04:04,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:04,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:04,239 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-28 06:04:04,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:04,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345662010] [2021-12-28 06:04:04,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345662010] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:04,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:04:04,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 06:04:04,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063619460] [2021-12-28 06:04:04,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:04,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 06:04:04,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:04,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 06:04:04,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 06:04:04,243 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-28 06:04:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:04,257 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2021-12-28 06:04:04,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 06:04:04,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-12-28 06:04:04,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:04,259 INFO L225 Difference]: With dead ends: 68 [2021-12-28 06:04:04,260 INFO L226 Difference]: Without dead ends: 68 [2021-12-28 06:04:04,260 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-28 06:04:04,261 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 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-28 06:04:04,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:04:04,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-28 06:04:04,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2021-12-28 06:04:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 57 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-28 06:04:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2021-12-28 06:04:04,271 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 8 [2021-12-28 06:04:04,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:04,272 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2021-12-28 06:04:04,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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-28 06:04:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2021-12-28 06:04:04,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-28 06:04:04,273 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:04,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:04,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 06:04:04,274 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:04,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:04,275 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2021-12-28 06:04:04,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:04,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234950273] [2021-12-28 06:04:04,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:04,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:04,317 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-28 06:04:04,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:04,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234950273] [2021-12-28 06:04:04,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234950273] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:04,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:04:04,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 06:04:04,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332450194] [2021-12-28 06:04:04,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:04,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 06:04:04,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:04,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 06:04:04,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:04:04,320 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-28 06:04:04,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:04,380 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2021-12-28 06:04:04,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:04:04,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-28 06:04:04,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:04,381 INFO L225 Difference]: With dead ends: 76 [2021-12-28 06:04:04,381 INFO L226 Difference]: Without dead ends: 76 [2021-12-28 06:04:04,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:04:04,382 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 164 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:04,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:04:04,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-28 06:04:04,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2021-12-28 06:04:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 56 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-28 06:04:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2021-12-28 06:04:04,386 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 9 [2021-12-28 06:04:04,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:04,386 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2021-12-28 06:04:04,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-28 06:04:04,386 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2021-12-28 06:04:04,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-28 06:04:04,387 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:04,387 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:04,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 06:04:04,387 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:04,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:04,388 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2021-12-28 06:04:04,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:04,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736346580] [2021-12-28 06:04:04,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:04,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:04,438 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-28 06:04:04,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:04,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736346580] [2021-12-28 06:04:04,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736346580] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:04,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:04:04,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 06:04:04,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628555527] [2021-12-28 06:04:04,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:04,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 06:04:04,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:04,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 06:04:04,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:04:04,440 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-28 06:04:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:04,494 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2021-12-28 06:04:04,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:04:04,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-28 06:04:04,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:04,495 INFO L225 Difference]: With dead ends: 61 [2021-12-28 06:04:04,495 INFO L226 Difference]: Without dead ends: 61 [2021-12-28 06:04:04,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-28 06:04:04,496 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 163 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:04,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 45 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:04:04,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2021-12-28 06:04:04,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2021-12-28 06:04:04,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:04,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2021-12-28 06:04:04,500 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2021-12-28 06:04:04,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:04,500 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2021-12-28 06:04:04,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-28 06:04:04,500 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2021-12-28 06:04:04,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-28 06:04:04,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:04,501 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:04,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 06:04:04,501 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:04,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:04,502 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2021-12-28 06:04:04,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:04,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815215442] [2021-12-28 06:04:04,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:04,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:04,536 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-28 06:04:04,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:04,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815215442] [2021-12-28 06:04:04,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815215442] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:04:04,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855248248] [2021-12-28 06:04:04,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:04,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:04:04,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:04:04,555 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-28 06:04:04,559 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-28 06:04:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:04,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 06:04:04,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:04:04,677 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-28 06:04:04,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:04:04,713 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-28 06:04:04,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855248248] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:04:04,713 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:04:04,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-28 06:04:04,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906256625] [2021-12-28 06:04:04,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:04:04,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 06:04:04,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:04,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 06:04:04,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:04:04,715 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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-28 06:04:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:04,723 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2021-12-28 06:04:04,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 06:04:04,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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 17 [2021-12-28 06:04:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:04,724 INFO L225 Difference]: With dead ends: 65 [2021-12-28 06:04:04,724 INFO L226 Difference]: Without dead ends: 65 [2021-12-28 06:04:04,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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-28 06:04:04,725 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 163 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-28 06:04:04,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 163 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:04:04,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-28 06:04:04,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-28 06:04:04,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.4) internal successors, (70), 64 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-28 06:04:04,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2021-12-28 06:04:04,729 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 17 [2021-12-28 06:04:04,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:04,729 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2021-12-28 06:04:04,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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-28 06:04:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2021-12-28 06:04:04,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 06:04:04,730 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:04,730 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:04,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 06:04:04,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-28 06:04:04,962 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:04,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:04,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2021-12-28 06:04:04,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:04,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651073575] [2021-12-28 06:04:04,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:04,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 06:04:05,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:05,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651073575] [2021-12-28 06:04:05,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651073575] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:05,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:04:05,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 06:04:05,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220130240] [2021-12-28 06:04:05,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:05,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 06:04:05,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:05,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 06:04:05,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-28 06:04:05,064 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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-28 06:04:05,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:05,271 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2021-12-28 06:04:05,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 06:04:05,272 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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 26 [2021-12-28 06:04:05,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:05,273 INFO L225 Difference]: With dead ends: 116 [2021-12-28 06:04:05,274 INFO L226 Difference]: Without dead ends: 116 [2021-12-28 06:04:05,274 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-28 06:04:05,275 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 379 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:05,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 141 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:04:05,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-28 06:04:05,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 68. [2021-12-28 06:04:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2021-12-28 06:04:05,290 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 26 [2021-12-28 06:04:05,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:05,290 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2021-12-28 06:04:05,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 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-28 06:04:05,291 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2021-12-28 06:04:05,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-28 06:04:05,292 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:05,292 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:05,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 06:04:05,292 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:05,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:05,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913171, now seen corresponding path program 1 times [2021-12-28 06:04:05,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:05,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794257029] [2021-12-28 06:04:05,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:05,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:04:05,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:05,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794257029] [2021-12-28 06:04:05,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794257029] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:05,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:04:05,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 06:04:05,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594078444] [2021-12-28 06:04:05,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:05,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 06:04:05,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:05,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 06:04:05,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-28 06:04:05,449 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:05,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:05,644 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2021-12-28 06:04:05,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 06:04:05,644 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-28 06:04:05,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:05,645 INFO L225 Difference]: With dead ends: 103 [2021-12-28 06:04:05,645 INFO L226 Difference]: Without dead ends: 103 [2021-12-28 06:04:05,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-28 06:04:05,646 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 389 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:05,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 103 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:04:05,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-28 06:04:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 68. [2021-12-28 06:04:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2021-12-28 06:04:05,648 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 26 [2021-12-28 06:04:05,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:05,648 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2021-12-28 06:04:05,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:05,649 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2021-12-28 06:04:05,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-28 06:04:05,649 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:05,649 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:05,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 06:04:05,650 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:05,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:05,650 INFO L85 PathProgramCache]: Analyzing trace with hash -893075880, now seen corresponding path program 1 times [2021-12-28 06:04:05,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:05,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247377496] [2021-12-28 06:04:05,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:05,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 06:04:05,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:05,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247377496] [2021-12-28 06:04:05,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247377496] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:05,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:04:05,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 06:04:05,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512612742] [2021-12-28 06:04:05,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:05,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 06:04:05,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:05,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 06:04:05,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-28 06:04:05,710 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:05,865 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2021-12-28 06:04:05,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 06:04:05,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-28 06:04:05,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:05,867 INFO L225 Difference]: With dead ends: 103 [2021-12-28 06:04:05,867 INFO L226 Difference]: Without dead ends: 103 [2021-12-28 06:04:05,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-28 06:04:05,868 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 363 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:05,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 124 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:04:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-28 06:04:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2021-12-28 06:04:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 70 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-28 06:04:05,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2021-12-28 06:04:05,871 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 28 [2021-12-28 06:04:05,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:05,871 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2021-12-28 06:04:05,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2021-12-28 06:04:05,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-28 06:04:05,872 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:05,872 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:05,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 06:04:05,872 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:05,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:05,873 INFO L85 PathProgramCache]: Analyzing trace with hash -893075879, now seen corresponding path program 1 times [2021-12-28 06:04:05,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:05,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508088020] [2021-12-28 06:04:05,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:05,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:05,919 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:04:05,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:05,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508088020] [2021-12-28 06:04:05,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508088020] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:04:05,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467483413] [2021-12-28 06:04:05,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:05,920 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:04:05,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:04:05,938 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-28 06:04:05,939 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-28 06:04:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:06,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 06:04:06,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:04:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-28 06:04:06,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 06:04:06,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467483413] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:06,080 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 06:04:06,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2021-12-28 06:04:06,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556916060] [2021-12-28 06:04:06,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:06,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 06:04:06,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:06,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 06:04:06,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:04:06,082 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:06,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:06,093 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2021-12-28 06:04:06,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 06:04:06,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-28 06:04:06,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:06,096 INFO L225 Difference]: With dead ends: 103 [2021-12-28 06:04:06,096 INFO L226 Difference]: Without dead ends: 103 [2021-12-28 06:04:06,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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-28 06:04:06,097 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 72 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:06,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 106 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:04:06,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-28 06:04:06,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 73. [2021-12-28 06:04:06,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:06,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2021-12-28 06:04:06,101 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 28 [2021-12-28 06:04:06,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:06,102 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2021-12-28 06:04:06,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2021-12-28 06:04:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-28 06:04:06,105 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:06,106 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:06,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 06:04:06,324 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,SelfDestructingSolverStorable9 [2021-12-28 06:04:06,324 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:06,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:06,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2021-12-28 06:04:06,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:06,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736022004] [2021-12-28 06:04:06,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:06,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-28 06:04:06,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:06,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736022004] [2021-12-28 06:04:06,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736022004] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:06,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:04:06,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 06:04:06,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289288516] [2021-12-28 06:04:06,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:06,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 06:04:06,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:06,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 06:04:06,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 06:04:06,368 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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-28 06:04:06,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:06,386 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2021-12-28 06:04:06,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 06:04:06,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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-28 06:04:06,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:06,387 INFO L225 Difference]: With dead ends: 147 [2021-12-28 06:04:06,388 INFO L226 Difference]: Without dead ends: 147 [2021-12-28 06:04:06,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:04:06,388 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 86 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 161 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-28 06:04:06,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 161 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:04:06,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-28 06:04:06,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 74. [2021-12-28 06:04:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 73 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-28 06:04:06,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2021-12-28 06:04:06,390 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 29 [2021-12-28 06:04:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:06,391 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2021-12-28 06:04:06,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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-28 06:04:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2021-12-28 06:04:06,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-28 06:04:06,392 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:06,392 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:06,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 06:04:06,392 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:06,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:06,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1668563827, now seen corresponding path program 1 times [2021-12-28 06:04:06,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:06,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586226290] [2021-12-28 06:04:06,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:06,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:04:06,466 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:06,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586226290] [2021-12-28 06:04:06,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586226290] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:04:06,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945555024] [2021-12-28 06:04:06,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:06,467 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:04:06,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:04:06,484 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-28 06:04:06,486 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-28 06:04:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:06,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 06:04:06,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:04:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-28 06:04:06,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:04:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-28 06:04:06,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945555024] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:04:06,722 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:04:06,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2021-12-28 06:04:06,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946532572] [2021-12-28 06:04:06,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:04:06,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 06:04:06,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:06,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 06:04:06,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-28 06:04:06,723 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:06,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:06,760 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2021-12-28 06:04:06,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 06:04:06,761 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-28 06:04:06,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:06,762 INFO L225 Difference]: With dead ends: 126 [2021-12-28 06:04:06,762 INFO L226 Difference]: Without dead ends: 126 [2021-12-28 06:04:06,762 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-12-28 06:04:06,762 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 127 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:06,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 275 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:04:06,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-28 06:04:06,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2021-12-28 06:04:06,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.44) internal successors, (108), 89 states have internal predecessors, (108), 0 states have call successors, (0), 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-28 06:04:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2021-12-28 06:04:06,765 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 33 [2021-12-28 06:04:06,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:06,765 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2021-12-28 06:04:06,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2021-12-28 06:04:06,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-28 06:04:06,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:06,766 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] [2021-12-28 06:04:06,798 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-28 06:04:06,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:04:06,983 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:06,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:06,984 INFO L85 PathProgramCache]: Analyzing trace with hash -146010198, now seen corresponding path program 1 times [2021-12-28 06:04:06,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:06,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057175773] [2021-12-28 06:04:06,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:06,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:04:07,216 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:07,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057175773] [2021-12-28 06:04:07,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057175773] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:04:07,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330968396] [2021-12-28 06:04:07,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:07,217 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:04:07,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:04:07,218 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-28 06:04:07,219 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-28 06:04:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:07,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-28 06:04:07,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:04:07,349 INFO L387 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-28 06:04:07,407 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 06:04:07,407 INFO L387 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-28 06:04:07,477 INFO L387 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-28 06:04:07,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:04:07,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 06:04:07,669 INFO L387 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 21 treesize of output 9 [2021-12-28 06:04:07,693 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:04:07,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:04:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:04:19,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330968396] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:04:19,397 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:04:19,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2021-12-28 06:04:19,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493042033] [2021-12-28 06:04:19,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:04:19,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-28 06:04:19,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:19,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-28 06:04:19,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1066, Unknown=1, NotChecked=0, Total=1190 [2021-12-28 06:04:19,399 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:20,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:20,289 INFO L93 Difference]: Finished difference Result 176 states and 212 transitions. [2021-12-28 06:04:20,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-28 06:04:20,290 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-28 06:04:20,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:20,291 INFO L225 Difference]: With dead ends: 176 [2021-12-28 06:04:20,292 INFO L226 Difference]: Without dead ends: 176 [2021-12-28 06:04:20,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=538, Invalid=2011, Unknown=1, NotChecked=0, Total=2550 [2021-12-28 06:04:20,293 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 1417 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:20,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1417 Valid, 563 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 684 Invalid, 0 Unknown, 58 Unchecked, 0.3s Time] [2021-12-28 06:04:20,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-12-28 06:04:20,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 100. [2021-12-28 06:04:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 99 states have internal predecessors, (123), 0 states have call successors, (0), 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-28 06:04:20,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2021-12-28 06:04:20,295 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 34 [2021-12-28 06:04:20,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:20,295 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2021-12-28 06:04:20,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2021-12-28 06:04:20,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-28 06:04:20,296 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:20,296 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] [2021-12-28 06:04:20,331 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-28 06:04:20,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:04:20,511 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:20,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:20,512 INFO L85 PathProgramCache]: Analyzing trace with hash -146010197, now seen corresponding path program 1 times [2021-12-28 06:04:20,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:20,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476748762] [2021-12-28 06:04:20,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:20,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:04:20,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:20,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476748762] [2021-12-28 06:04:20,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476748762] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:04:20,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066705746] [2021-12-28 06:04:20,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:20,886 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:04:20,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:04:20,887 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-28 06:04:20,889 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-28 06:04:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:20,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 75 conjunts are in the unsatisfiable core [2021-12-28 06:04:20,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:04:21,001 INFO L387 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-28 06:04:21,245 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-28 06:04:21,245 INFO L387 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 14 treesize of output 20 [2021-12-28 06:04:21,267 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:04:21,268 INFO L387 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-28 06:04:21,476 INFO L387 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-28 06:04:21,483 INFO L387 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-28 06:04:21,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:04:21,763 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 34 [2021-12-28 06:04:21,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:04:21,769 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2021-12-28 06:04:21,860 INFO L387 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 39 treesize of output 21 [2021-12-28 06:04:21,870 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2021-12-28 06:04:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 06:04:21,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:04:24,301 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse0))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) is different from false [2021-12-28 06:04:26,333 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse0))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) is different from false [2021-12-28 06:04:28,388 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse0))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) is different from false [2021-12-28 06:04:30,721 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse0))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))))))) is different from false [2021-12-28 06:04:30,732 INFO L387 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 53 treesize of output 51 [2021-12-28 06:04:30,735 INFO L387 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 51 treesize of output 47 [2021-12-28 06:04:30,738 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:04:30,740 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:04:31,104 INFO L387 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 35 treesize of output 31 [2021-12-28 06:04:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-28 06:04:31,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066705746] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:04:31,191 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:04:31,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 48 [2021-12-28 06:04:31,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618098683] [2021-12-28 06:04:31,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:04:31,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-12-28 06:04:31,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:31,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-12-28 06:04:31,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1853, Unknown=4, NotChecked=356, Total=2352 [2021-12-28 06:04:31,193 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 49 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 49 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:32,752 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5))) (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select |c_#length| .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ 8 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) .cse0) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_#res#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse1))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))))))) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= .cse2 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (<= 8 .cse0) (<= (+ .cse2 8) .cse3) (<= 8 .cse3) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse4)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))))) is different from false [2021-12-28 06:04:33,519 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse1 (select .cse0 .cse5)) (.cse2 (select .cse4 .cse5))) (and (<= 8 (select |c_#length| (select .cse0 4))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ .cse2 8) (select |c_#length| .cse1)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse3) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse3))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) (<= 0 .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select .cse4 4) 0)))) is different from false [2021-12-28 06:04:33,989 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse1 (select .cse0 .cse5)) (.cse2 (select .cse4 .cse5))) (and (<= 8 (select |c_#length| (select .cse0 4))) (not (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ .cse2 8) (select |c_#length| .cse1)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse3) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse3))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) (<= 0 .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select .cse4 4) 0)))) is different from false [2021-12-28 06:04:34,488 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse5)) (.cse4 (select .cse3 .cse5))) (and (= (select .cse0 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 0 .cse1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse2) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse2))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) (<= 8 (select |c_#length| (select .cse3 4))) (<= (+ 8 .cse1) (select |c_#length| .cse4)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse4))))) is different from false [2021-12-28 06:04:34,982 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select .cse1 .cse5)) (.cse3 (select .cse0 .cse5))) (and (<= 8 (select |c_#length| (select .cse0 4))) (= (select .cse1 4) 0) (<= 0 .cse2) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= (+ 8 .cse2) (select |c_#length| .cse3)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse3)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse4) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse4))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))))))))) is different from false [2021-12-28 06:04:36,122 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5))) (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select |c_#length| .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ 8 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) .cse0) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_#res#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse1))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))))))) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= .cse2 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (<= 8 .cse0) (<= (+ .cse2 8) .cse3) (<= 8 .cse3) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse4)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))))) is different from false [2021-12-28 06:04:36,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:36,555 INFO L93 Difference]: Finished difference Result 228 states and 283 transitions. [2021-12-28 06:04:36,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-28 06:04:36,556 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 49 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-28 06:04:36,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:36,557 INFO L225 Difference]: With dead ends: 228 [2021-12-28 06:04:36,557 INFO L226 Difference]: Without dead ends: 228 [2021-12-28 06:04:36,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=396, Invalid=3056, Unknown=10, NotChecked=1230, Total=4692 [2021-12-28 06:04:36,558 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 592 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 739 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:36,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [592 Valid, 1387 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 856 Invalid, 0 Unknown, 739 Unchecked, 0.5s Time] [2021-12-28 06:04:36,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-12-28 06:04:36,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 108. [2021-12-28 06:04:36,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 107 states have internal predecessors, (134), 0 states have call successors, (0), 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-28 06:04:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 134 transitions. [2021-12-28 06:04:36,561 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 134 transitions. Word has length 34 [2021-12-28 06:04:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:36,561 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 134 transitions. [2021-12-28 06:04:36,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 49 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:36,561 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 134 transitions. [2021-12-28 06:04:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-28 06:04:36,561 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:36,561 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:36,593 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-28 06:04:36,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-28 06:04:36,762 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:36,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:36,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1013729350, now seen corresponding path program 2 times [2021-12-28 06:04:36,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:36,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737695621] [2021-12-28 06:04:36,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:36,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-28 06:04:36,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:36,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737695621] [2021-12-28 06:04:36,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737695621] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:04:36,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953464812] [2021-12-28 06:04:36,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 06:04:36,814 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:04:36,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:04:36,815 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-28 06:04:36,816 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-28 06:04:36,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 06:04:36,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 06:04:36,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 06:04:36,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:04:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 06:04:36,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:04:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-12-28 06:04:37,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953464812] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:04:37,039 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:04:37,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2021-12-28 06:04:37,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246246564] [2021-12-28 06:04:37,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:04:37,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:04:37,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:37,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:04:37,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:04:37,040 INFO L87 Difference]: Start difference. First operand 108 states and 134 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:37,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:37,089 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2021-12-28 06:04:37,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 06:04:37,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-28 06:04:37,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:37,090 INFO L225 Difference]: With dead ends: 100 [2021-12-28 06:04:37,090 INFO L226 Difference]: Without dead ends: 100 [2021-12-28 06:04:37,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-12-28 06:04:37,091 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 203 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:37,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 136 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:04:37,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-28 06:04:37,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2021-12-28 06:04:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 93 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2021-12-28 06:04:37,093 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 37 [2021-12-28 06:04:37,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:37,093 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2021-12-28 06:04:37,093 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:37,093 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2021-12-28 06:04:37,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-28 06:04:37,093 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:37,094 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:37,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-28 06:04:37,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-28 06:04:37,303 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:37,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:37,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1104183591, now seen corresponding path program 2 times [2021-12-28 06:04:37,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:37,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946008418] [2021-12-28 06:04:37,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:37,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 06:04:37,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:37,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946008418] [2021-12-28 06:04:37,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946008418] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:04:37,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091201780] [2021-12-28 06:04:37,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 06:04:37,370 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:04:37,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:04:37,371 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-28 06:04:37,372 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-28 06:04:37,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 06:04:37,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 06:04:37,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 06:04:37,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:04:37,528 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-28 06:04:37,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:04:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-28 06:04:37,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091201780] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:04:37,574 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:04:37,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2021-12-28 06:04:37,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110725115] [2021-12-28 06:04:37,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:04:37,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 06:04:37,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:37,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 06:04:37,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-28 06:04:37,575 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 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-28 06:04:37,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:37,661 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2021-12-28 06:04:37,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 06:04:37,662 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-28 06:04:37,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:37,662 INFO L225 Difference]: With dead ends: 96 [2021-12-28 06:04:37,662 INFO L226 Difference]: Without dead ends: 96 [2021-12-28 06:04:37,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-12-28 06:04:37,663 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 156 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:37,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 346 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:04:37,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-28 06:04:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2021-12-28 06:04:37,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.358974358974359) internal successors, (106), 89 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2021-12-28 06:04:37,664 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 38 [2021-12-28 06:04:37,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:37,664 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2021-12-28 06:04:37,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 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-28 06:04:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2021-12-28 06:04:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-28 06:04:37,665 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:37,665 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:37,682 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-28 06:04:37,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:04:37,873 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:37,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:37,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1861613195, now seen corresponding path program 1 times [2021-12-28 06:04:37,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:37,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717192704] [2021-12-28 06:04:37,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:37,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:37,986 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-28 06:04:37,986 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:37,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717192704] [2021-12-28 06:04:37,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717192704] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:37,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:04:37,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 06:04:37,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860353092] [2021-12-28 06:04:37,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:37,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 06:04:37,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:37,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 06:04:37,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-28 06:04:37,988 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 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-28 06:04:38,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:38,158 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2021-12-28 06:04:38,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 06:04:38,159 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 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 41 [2021-12-28 06:04:38,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:38,159 INFO L225 Difference]: With dead ends: 119 [2021-12-28 06:04:38,159 INFO L226 Difference]: Without dead ends: 119 [2021-12-28 06:04:38,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-28 06:04:38,160 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 467 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:38,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 75 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 06:04:38,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-28 06:04:38,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2021-12-28 06:04:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 89 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2021-12-28 06:04:38,161 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 41 [2021-12-28 06:04:38,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:38,162 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2021-12-28 06:04:38,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 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-28 06:04:38,162 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2021-12-28 06:04:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-28 06:04:38,162 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:38,162 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-28 06:04:38,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 06:04:38,162 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:38,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:38,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1835573310, now seen corresponding path program 3 times [2021-12-28 06:04:38,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:38,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916183014] [2021-12-28 06:04:38,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:38,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:38,213 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 06:04:38,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:38,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916183014] [2021-12-28 06:04:38,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916183014] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:04:38,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524527855] [2021-12-28 06:04:38,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-28 06:04:38,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:04:38,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:04:38,216 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-28 06:04:38,243 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-28 06:04:38,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-28 06:04:38,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 06:04:38,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 06:04:38,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:04:38,465 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-28 06:04:38,465 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 06:04:38,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524527855] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:38,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 06:04:38,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2021-12-28 06:04:38,466 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298823062] [2021-12-28 06:04:38,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:38,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 06:04:38,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:38,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 06:04:38,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-28 06:04:38,467 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:38,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:38,483 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2021-12-28 06:04:38,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 06:04:38,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-28 06:04:38,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:38,484 INFO L225 Difference]: With dead ends: 90 [2021-12-28 06:04:38,484 INFO L226 Difference]: Without dead ends: 90 [2021-12-28 06:04:38,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-28 06:04:38,485 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 74 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:38,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 156 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:04:38,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2021-12-28 06:04:38,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2021-12-28 06:04:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:38,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2021-12-28 06:04:38,500 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 42 [2021-12-28 06:04:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:38,500 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2021-12-28 06:04:38,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2021-12-28 06:04:38,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-28 06:04:38,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:38,501 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2021-12-28 06:04:38,521 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-28 06:04:38,702 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,SelfDestructingSolverStorable17 [2021-12-28 06:04:38,703 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:38,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:38,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1595673087, now seen corresponding path program 1 times [2021-12-28 06:04:38,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:38,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217314654] [2021-12-28 06:04:38,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:38,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-28 06:04:38,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:38,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217314654] [2021-12-28 06:04:38,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217314654] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 06:04:38,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 06:04:38,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 06:04:38,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272745510] [2021-12-28 06:04:38,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 06:04:38,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 06:04:38,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:38,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 06:04:38,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 06:04:38,765 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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-28 06:04:38,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:38,780 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2021-12-28 06:04:38,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 06:04:38,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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 44 [2021-12-28 06:04:38,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:38,781 INFO L225 Difference]: With dead ends: 81 [2021-12-28 06:04:38,781 INFO L226 Difference]: Without dead ends: 81 [2021-12-28 06:04:38,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-28 06:04:38,781 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 19 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:38,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 149 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:04:38,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2021-12-28 06:04:38,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2021-12-28 06:04:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 78 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-28 06:04:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2021-12-28 06:04:38,784 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 44 [2021-12-28 06:04:38,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:38,784 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2021-12-28 06:04:38,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 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-28 06:04:38,784 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2021-12-28 06:04:38,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-28 06:04:38,785 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:38,785 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 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-28 06:04:38,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-28 06:04:38,785 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:38,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:38,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2124312202, now seen corresponding path program 1 times [2021-12-28 06:04:38,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:38,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250921571] [2021-12-28 06:04:38,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:38,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:04:39,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:39,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250921571] [2021-12-28 06:04:39,268 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250921571] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:04:39,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942341665] [2021-12-28 06:04:39,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:39,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:04:39,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:04:39,276 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-28 06:04:39,291 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-28 06:04:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:39,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 93 conjunts are in the unsatisfiable core [2021-12-28 06:04:39,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:04:39,443 INFO L387 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-28 06:04:39,579 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:04:39,579 INFO L387 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-28 06:04:39,699 INFO L387 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-28 06:04:39,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2021-12-28 06:04:39,938 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-28 06:04:40,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:04:40,056 INFO L387 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 18 treesize of output 8 [2021-12-28 06:04:40,152 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 06:04:40,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-28 06:04:40,376 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:04:40,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:04:40,484 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1120 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1120 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2021-12-28 06:04:40,495 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1120 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1120 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2021-12-28 06:04:40,503 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1120 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1120 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2021-12-28 06:04:40,515 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1120 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1120 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2021-12-28 06:04:40,532 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:04:40,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-28 06:04:40,538 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:04:40,538 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 61 [2021-12-28 06:04:40,541 INFO L387 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 23 treesize of output 21 [2021-12-28 06:04:40,580 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:04:40,581 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-28 06:04:40,584 INFO L387 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 58 treesize of output 50 [2021-12-28 06:04:40,588 INFO L387 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 23 treesize of output 21 [2021-12-28 06:04:40,842 INFO L387 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 18 treesize of output 16 [2021-12-28 06:04:41,121 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2021-12-28 06:04:41,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942341665] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:04:41,121 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:04:41,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 24] total 66 [2021-12-28 06:04:41,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28744561] [2021-12-28 06:04:41,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:04:41,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-12-28 06:04:41,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:41,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-12-28 06:04:41,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3573, Unknown=4, NotChecked=492, Total=4290 [2021-12-28 06:04:41,124 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 66 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 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-28 06:04:42,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:42,497 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2021-12-28 06:04:42,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-28 06:04:42,497 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-12-28 06:04:42,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:42,498 INFO L225 Difference]: With dead ends: 86 [2021-12-28 06:04:42,498 INFO L226 Difference]: Without dead ends: 86 [2021-12-28 06:04:42,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=864, Invalid=6804, Unknown=4, NotChecked=700, Total=8372 [2021-12-28 06:04:42,500 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 395 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 496 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:42,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 751 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 949 Invalid, 0 Unknown, 496 Unchecked, 0.4s Time] [2021-12-28 06:04:42,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-28 06:04:42,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2021-12-28 06:04:42,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:42,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2021-12-28 06:04:42,507 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 45 [2021-12-28 06:04:42,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:42,507 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2021-12-28 06:04:42,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 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-28 06:04:42,508 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2021-12-28 06:04:42,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-28 06:04:42,509 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:42,509 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1] [2021-12-28 06:04:42,526 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-28 06:04:42,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:04:42,726 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:42,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:42,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1599429550, now seen corresponding path program 1 times [2021-12-28 06:04:42,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:42,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049360299] [2021-12-28 06:04:42,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:42,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:04:43,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:43,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049360299] [2021-12-28 06:04:43,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049360299] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:04:43,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818953001] [2021-12-28 06:04:43,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:43,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:04:43,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:04:43,244 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-28 06:04:43,245 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-28 06:04:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:43,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-28 06:04:43,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:04:43,425 INFO L387 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-28 06:04:43,537 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:04:43,538 INFO L387 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-28 06:04:43,628 INFO L387 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-28 06:04:43,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:04:43,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-28 06:04:44,030 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:04:44,030 INFO L387 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-28 06:04:44,200 INFO L387 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 31 treesize of output 13 [2021-12-28 06:04:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 06:04:44,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:04:44,330 INFO L353 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2021-12-28 06:04:44,331 INFO L387 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 21 treesize of output 20 [2021-12-28 06:04:44,334 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2021-12-28 06:04:44,342 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2021-12-28 06:04:44,346 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2021-12-28 06:04:44,354 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse0)))) is different from false [2021-12-28 06:04:44,365 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (v_ArrVal_1229 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1229))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) is different from false [2021-12-28 06:04:44,380 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) is different from false [2021-12-28 06:04:44,392 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) .cse1))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) is different from false [2021-12-28 06:04:44,401 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2)))))) is different from false [2021-12-28 06:04:44,437 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) is different from false [2021-12-28 06:04:44,453 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:04:44,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 51 [2021-12-28 06:04:44,458 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:04:44,459 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:04:44,462 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:04:44,463 INFO L387 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 2 case distinctions, treesize of input 27 treesize of output 31 [2021-12-28 06:04:44,466 INFO L387 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 36 treesize of output 24 [2021-12-28 06:04:44,469 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-28 06:04:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2021-12-28 06:04:44,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818953001] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:04:44,629 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:04:44,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 21] total 60 [2021-12-28 06:04:44,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902782668] [2021-12-28 06:04:44,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:04:44,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2021-12-28 06:04:44,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:44,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2021-12-28 06:04:44,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2528, Unknown=9, NotChecked=972, Total=3660 [2021-12-28 06:04:44,632 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 61 states, 60 states have (on average 2.3) internal successors, (138), 61 states have internal predecessors, (138), 0 states have call successors, (0), 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-28 06:04:45,228 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0))) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse2 .cse3))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))) is different from false [2021-12-28 06:04:45,230 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2021-12-28 06:04:45,235 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2)))))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2021-12-28 06:04:45,258 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) .cse1))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))))) is different from false [2021-12-28 06:04:45,262 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2021-12-28 06:04:45,510 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0))) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse2 .cse3))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))) is different from false [2021-12-28 06:04:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:04:46,619 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2021-12-28 06:04:46,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-28 06:04:46,620 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.3) internal successors, (138), 61 states have internal predecessors, (138), 0 states have call successors, (0), 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 51 [2021-12-28 06:04:46,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:04:46,621 INFO L225 Difference]: With dead ends: 128 [2021-12-28 06:04:46,621 INFO L226 Difference]: Without dead ends: 128 [2021-12-28 06:04:46,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=568, Invalid=5177, Unknown=15, NotChecked=2430, Total=8190 [2021-12-28 06:04:46,622 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 980 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 906 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-28 06:04:46,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [980 Valid, 933 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1380 Invalid, 0 Unknown, 906 Unchecked, 0.7s Time] [2021-12-28 06:04:46,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-12-28 06:04:46,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 83. [2021-12-28 06:04:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 82 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2021-12-28 06:04:46,624 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 51 [2021-12-28 06:04:46,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:04:46,624 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2021-12-28 06:04:46,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.3) internal successors, (138), 61 states have internal predecessors, (138), 0 states have call successors, (0), 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-28 06:04:46,624 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2021-12-28 06:04:46,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-28 06:04:46,625 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:04:46,625 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1] [2021-12-28 06:04:46,644 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-28 06:04:46,833 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-28 06:04:46,833 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:04:46,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:04:46,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1599429551, now seen corresponding path program 1 times [2021-12-28 06:04:46,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:04:46,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526865679] [2021-12-28 06:04:46,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:46,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:04:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:47,491 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:04:47,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:04:47,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526865679] [2021-12-28 06:04:47,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526865679] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:04:47,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929372450] [2021-12-28 06:04:47,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:04:47,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:04:47,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:04:47,493 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-28 06:04:47,494 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-28 06:04:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:04:47,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 81 conjunts are in the unsatisfiable core [2021-12-28 06:04:47,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:04:47,636 INFO L387 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-28 06:04:47,735 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:04:47,736 INFO L387 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-28 06:04:47,814 INFO L387 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-28 06:04:47,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:04:47,966 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-28 06:04:47,968 INFO L387 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 6 treesize of output 5 [2021-12-28 06:04:48,104 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:04:48,105 INFO L387 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-28 06:04:48,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-28 06:04:48,294 INFO L387 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 39 treesize of output 21 [2021-12-28 06:04:48,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2021-12-28 06:04:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 06:04:48,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:04:48,540 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:04:48,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2021-12-28 06:04:48,910 INFO L387 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 448 treesize of output 412 [2021-12-28 06:04:48,915 INFO L387 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 376 treesize of output 352 [2021-12-28 06:04:48,919 INFO L387 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 333 treesize of output 325 [2021-12-28 06:04:48,924 INFO L387 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 325 treesize of output 309 [2021-12-28 06:04:49,056 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (forall ((v_ArrVal_1340 Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1340)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))))) (and (or (not .cse0) .cse1) (or .cse0 .cse1) .cse1 (forall ((v_ArrVal_1340 Int) (v_ArrVal_1342 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1340))) (.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) .cse4))) (= .cse2 (select (select (store .cse3 .cse2 v_ArrVal_1342) |c_ULTIMATE.start_main_~s~0#1.base|) .cse4))))))) is different from false [2021-12-28 06:04:49,064 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1340 Int)) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1340)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1340 Int) (v_ArrVal_1342 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1340))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1342) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2)))))) is different from false [2021-12-28 06:04:51,087 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (and (forall ((v_ArrVal_1340 Int) (v_ArrVal_1342 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0 v_ArrVal_1342) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))) (forall ((v_ArrVal_1340 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) is different from false [2021-12-28 06:04:53,107 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (and (forall ((v_ArrVal_1340 Int)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))))) (forall ((v_ArrVal_1340 Int) (v_ArrVal_1342 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1342) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) .cse1))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) is different from false [2021-12-28 06:04:55,126 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (and (forall ((v_ArrVal_1340 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_1340 Int) (v_ArrVal_1342 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1342) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2)))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) is different from false [2021-12-28 06:04:57,180 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (and (forall ((v_ArrVal_1340 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1340 Int) (v_ArrVal_1342 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_1342) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2)))))))) is different from false [2021-12-28 06:04:57,190 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:04:57,190 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 68 [2021-12-28 06:04:57,192 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:04:57,193 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:04:57,196 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:04:57,196 INFO L387 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 2 case distinctions, treesize of input 32 treesize of output 36 [2021-12-28 06:04:57,199 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:04:57,200 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:04:57,200 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2021-12-28 06:04:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2021-12-28 06:04:57,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929372450] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:04:57,374 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:04:57,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 22] total 63 [2021-12-28 06:04:57,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9863118] [2021-12-28 06:04:57,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:04:57,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2021-12-28 06:04:57,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:04:57,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2021-12-28 06:04:57,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3154, Unknown=6, NotChecked=702, Total=4032 [2021-12-28 06:04:57,375 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 64 states, 63 states have (on average 2.238095238095238) internal successors, (141), 64 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:04:57,910 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (and (forall ((v_ArrVal_1340 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1340 Int) (v_ArrVal_1342 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_1342) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2)))))))) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))) is different from false [2021-12-28 06:04:59,912 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (and (forall ((v_ArrVal_1340 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_1340 Int) (v_ArrVal_1342 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1342) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2)))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2021-12-28 06:05:01,915 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (and (forall ((v_ArrVal_1340 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (forall ((v_ArrVal_1340 Int) (v_ArrVal_1342 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1342) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2)))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2021-12-28 06:05:01,942 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (and (forall ((v_ArrVal_1340 Int)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))))) (forall ((v_ArrVal_1340 Int) (v_ArrVal_1342 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1342) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) .cse1))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))))) is different from false [2021-12-28 06:05:01,948 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (and (forall ((v_ArrVal_1340 Int) (v_ArrVal_1342 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0 v_ArrVal_1342) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))) (forall ((v_ArrVal_1340 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|)))) is different from false [2021-12-28 06:05:02,150 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (and (forall ((v_ArrVal_1340 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1340 Int) (v_ArrVal_1342 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_1342) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2)))))))) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3))) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))) is different from false [2021-12-28 06:05:03,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:05:03,194 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2021-12-28 06:05:03,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2021-12-28 06:05:03,195 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 2.238095238095238) internal successors, (141), 64 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-12-28 06:05:03,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:05:03,195 INFO L225 Difference]: With dead ends: 136 [2021-12-28 06:05:03,195 INFO L226 Difference]: Without dead ends: 136 [2021-12-28 06:05:03,197 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1143 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=656, Invalid=6352, Unknown=12, NotChecked=2100, Total=9120 [2021-12-28 06:05:03,199 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 974 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 2394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 858 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-28 06:05:03,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [974 Valid, 1197 Invalid, 2394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1411 Invalid, 0 Unknown, 858 Unchecked, 0.6s Time] [2021-12-28 06:05:03,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-28 06:05:03,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 82. [2021-12-28 06:05:03,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 81 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-28 06:05:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2021-12-28 06:05:03,207 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 51 [2021-12-28 06:05:03,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:05:03,207 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2021-12-28 06:05:03,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 2.238095238095238) internal successors, (141), 64 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:05:03,207 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2021-12-28 06:05:03,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-28 06:05:03,214 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:05:03,214 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1] [2021-12-28 06:05:03,232 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-28 06:05:03,430 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-28 06:05:03,430 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:05:03,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:05:03,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1599429606, now seen corresponding path program 1 times [2021-12-28 06:05:03,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:05:03,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887762217] [2021-12-28 06:05:03,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:05:03,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:05:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:05:03,483 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-28 06:05:03,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:05:03,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887762217] [2021-12-28 06:05:03,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887762217] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:05:03,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566081937] [2021-12-28 06:05:03,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:05:03,484 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:05:03,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:05:03,499 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-28 06:05:03,500 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-28 06:05:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:05:03,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 06:05:03,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:05:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-28 06:05:03,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:05:03,756 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-28 06:05:03,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566081937] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:05:03,756 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:05:03,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2021-12-28 06:05:03,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623296391] [2021-12-28 06:05:03,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:05:03,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 06:05:03,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:05:03,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 06:05:03,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:05:03,757 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:05:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:05:03,794 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2021-12-28 06:05:03,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 06:05:03,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2021-12-28 06:05:03,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:05:03,795 INFO L225 Difference]: With dead ends: 73 [2021-12-28 06:05:03,795 INFO L226 Difference]: Without dead ends: 73 [2021-12-28 06:05:03,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2021-12-28 06:05:03,795 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 85 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:05:03,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 135 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:05:03,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-28 06:05:03,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-12-28 06:05:03,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 72 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-28 06:05:03,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2021-12-28 06:05:03,799 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 51 [2021-12-28 06:05:03,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:05:03,799 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2021-12-28 06:05:03,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:05:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2021-12-28 06:05:03,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-28 06:05:03,803 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:05:03,803 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-12-28 06:05:03,820 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-28 06:05:04,019 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,SelfDestructingSolverStorable22 [2021-12-28 06:05:04,019 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:05:04,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:05:04,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2007861849, now seen corresponding path program 1 times [2021-12-28 06:05:04,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:05:04,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589000655] [2021-12-28 06:05:04,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:05:04,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:05:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:05:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-28 06:05:04,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:05:04,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589000655] [2021-12-28 06:05:04,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589000655] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:05:04,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368683462] [2021-12-28 06:05:04,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:05:04,050 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:05:04,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:05:04,051 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-28 06:05:04,052 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-28 06:05:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:05:04,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-28 06:05:04,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:05:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-28 06:05:04,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:05:04,263 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-28 06:05:04,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368683462] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:05:04,263 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:05:04,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2021-12-28 06:05:04,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559828395] [2021-12-28 06:05:04,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:05:04,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 06:05:04,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:05:04,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 06:05:04,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 06:05:04,265 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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-28 06:05:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 06:05:04,290 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2021-12-28 06:05:04,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 06:05:04,291 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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 52 [2021-12-28 06:05:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 06:05:04,291 INFO L225 Difference]: With dead ends: 73 [2021-12-28 06:05:04,291 INFO L226 Difference]: Without dead ends: 73 [2021-12-28 06:05:04,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-28 06:05:04,291 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 72 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 06:05:04,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 150 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 06:05:04,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-12-28 06:05:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-12-28 06:05:04,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.121212121212121) internal successors, (74), 72 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 06:05:04,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2021-12-28 06:05:04,293 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 52 [2021-12-28 06:05:04,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 06:05:04,293 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2021-12-28 06:05:04,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 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-28 06:05:04,293 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2021-12-28 06:05:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-28 06:05:04,293 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 06:05:04,293 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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-28 06:05:04,312 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-28 06:05:04,494 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,SelfDestructingSolverStorable23 [2021-12-28 06:05:04,494 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-28 06:05:04,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 06:05:04,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1192937808, now seen corresponding path program 1 times [2021-12-28 06:05:04,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 06:05:04,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373893848] [2021-12-28 06:05:04,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:05:04,495 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 06:05:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:05:05,016 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:05:05,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 06:05:05,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373893848] [2021-12-28 06:05:05,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373893848] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 06:05:05,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347282907] [2021-12-28 06:05:05,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 06:05:05,017 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 06:05:05,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 06:05:05,028 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-28 06:05:05,032 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-28 06:05:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 06:05:05,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 101 conjunts are in the unsatisfiable core [2021-12-28 06:05:05,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 06:05:05,174 INFO L387 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-28 06:05:05,214 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-28 06:05:05,214 INFO L387 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-28 06:05:05,283 INFO L387 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-28 06:05:05,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 06:05:05,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2021-12-28 06:05:05,449 INFO L387 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 6 treesize of output 5 [2021-12-28 06:05:05,578 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-28 06:05:05,578 INFO L387 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 66 treesize of output 63 [2021-12-28 06:05:05,580 INFO L387 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 31 treesize of output 21 [2021-12-28 06:05:05,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2021-12-28 06:05:05,749 INFO L387 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 39 treesize of output 21 [2021-12-28 06:05:05,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-12-28 06:05:05,795 INFO L387 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 22 treesize of output 10 [2021-12-28 06:05:05,831 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 06:05:05,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 06:05:06,146 INFO L387 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 86 treesize of output 64 [2021-12-28 06:05:06,159 INFO L387 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 86 treesize of output 64 [2021-12-28 06:05:06,172 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (forall ((v_ArrVal_1664 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= |c_ULTIMATE.start_sll_update_at_~data#1| .cse0) (forall ((v_ArrVal_1661 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= .cse0 |c_ULTIMATE.start_sll_update_at_~data#1|))) is different from false [2021-12-28 06:05:06,187 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (<= |c_ULTIMATE.start_sll_update_at_~data#1| .cse0) (forall ((v_ArrVal_1664 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1661 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (<= .cse0 |c_ULTIMATE.start_sll_update_at_~data#1|))) is different from false [2021-12-28 06:05:06,196 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (<= |c_ULTIMATE.start_sll_update_at_~data#1| .cse0) (forall ((v_ArrVal_1661 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1) v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (forall ((v_ArrVal_1664 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (<= .cse0 |c_ULTIMATE.start_sll_update_at_~data#1|))) is different from false [2021-12-28 06:05:06,211 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1661 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (forall ((v_ArrVal_1664 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (<= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2021-12-28 06:05:06,219 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1661 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (forall ((v_ArrVal_1664 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) is different from false [2021-12-28 06:05:06,235 INFO L387 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 254 treesize of output 230 [2021-12-28 06:05:06,238 INFO L387 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 194 treesize of output 178 [2021-12-28 06:05:06,241 INFO L387 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 178 treesize of output 162 [2021-12-28 06:05:06,284 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1660)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1660))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) .cse3 (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (or (not (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) .cse3))) is different from false [2021-12-28 06:05:06,293 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1660))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1660)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2021-12-28 06:05:08,326 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (and (forall ((v_ArrVal_1660 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) is different from false [2021-12-28 06:05:10,350 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|) (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))))))) is different from false [2021-12-28 06:05:12,369 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))))) (forall ((v_ArrVal_1660 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) is different from false [2021-12-28 06:05:14,425 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) is different from false [2021-12-28 06:05:14,446 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:05:14,447 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 68 [2021-12-28 06:05:14,448 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:05:14,450 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:05:14,454 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:05:14,454 INFO L387 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 2 case distinctions, treesize of input 32 treesize of output 36 [2021-12-28 06:05:14,456 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 06:05:14,458 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-28 06:05:14,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2021-12-28 06:05:14,604 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2021-12-28 06:05:14,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347282907] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 06:05:14,604 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 06:05:14,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 29] total 65 [2021-12-28 06:05:14,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446042597] [2021-12-28 06:05:14,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 06:05:14,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2021-12-28 06:05:14,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 06:05:14,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2021-12-28 06:05:14,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2721, Unknown=11, NotChecked=1254, Total=4160 [2021-12-28 06:05:14,606 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 65 states, 65 states have (on average 2.123076923076923) internal successors, (138), 65 states have internal predecessors, (138), 0 states have call successors, (0), 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-28 06:05:14,969 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) is different from false