./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa --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 e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 01:15:36,163 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 01:15:36,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 01:15:36,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 01:15:36,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 01:15:36,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 01:15:36,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 01:15:36,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 01:15:36,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 01:15:36,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 01:15:36,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 01:15:36,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 01:15:36,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 01:15:36,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 01:15:36,210 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 01:15:36,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 01:15:36,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 01:15:36,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 01:15:36,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 01:15:36,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 01:15:36,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 01:15:36,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 01:15:36,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 01:15:36,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 01:15:36,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 01:15:36,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 01:15:36,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 01:15:36,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 01:15:36,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 01:15:36,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 01:15:36,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 01:15:36,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 01:15:36,228 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 01:15:36,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 01:15:36,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 01:15:36,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 01:15:36,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 01:15:36,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 01:15:36,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 01:15:36,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 01:15:36,231 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 01:15:36,232 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-07 01:15:36,248 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 01:15:36,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 01:15:36,248 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 01:15:36,249 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 01:15:36,249 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 01:15:36,249 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 01:15:36,250 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 01:15:36,250 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 01:15:36,250 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 01:15:36,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 01:15:36,250 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 01:15:36,250 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-07 01:15:36,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 01:15:36,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 01:15:36,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 01:15:36,251 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-07 01:15:36,251 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-07 01:15:36,251 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-07 01:15:36,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 01:15:36,251 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-07 01:15:36,251 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 01:15:36,251 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 01:15:36,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 01:15:36,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 01:15:36,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 01:15:36,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:15:36,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 01:15:36,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 01:15:36,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 01:15:36,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 01:15:36,252 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 01:15:36,252 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa 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 -> e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c [2021-12-07 01:15:36,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 01:15:36,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 01:15:36,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 01:15:36,443 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 01:15:36,443 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 01:15:36,444 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2021-12-07 01:15:36,486 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/data/623c36254/268bf771e0bf4543bae3cb7443681552/FLAG0066ef0d1 [2021-12-07 01:15:36,930 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 01:15:36,931 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2021-12-07 01:15:36,941 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/data/623c36254/268bf771e0bf4543bae3cb7443681552/FLAG0066ef0d1 [2021-12-07 01:15:37,264 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/data/623c36254/268bf771e0bf4543bae3cb7443681552 [2021-12-07 01:15:37,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 01:15:37,267 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 01:15:37,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 01:15:37,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 01:15:37,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 01:15:37,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:15:37" (1/1) ... [2021-12-07 01:15:37,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47a7d1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:37, skipping insertion in model container [2021-12-07 01:15:37,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:15:37" (1/1) ... [2021-12-07 01:15:37,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 01:15:37,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 01:15:37,508 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:15:37,514 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 01:15:37,548 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:15:37,568 INFO L208 MainTranslator]: Completed translation [2021-12-07 01:15:37,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:37 WrapperNode [2021-12-07 01:15:37,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 01:15:37,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 01:15:37,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 01:15:37,570 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 01:15:37,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:37" (1/1) ... [2021-12-07 01:15:37,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:37" (1/1) ... [2021-12-07 01:15:37,608 INFO L137 Inliner]: procedures = 123, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2021-12-07 01:15:37,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 01:15:37,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 01:15:37,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 01:15:37,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 01:15:37,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:37" (1/1) ... [2021-12-07 01:15:37,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:37" (1/1) ... [2021-12-07 01:15:37,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:37" (1/1) ... [2021-12-07 01:15:37,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:37" (1/1) ... [2021-12-07 01:15:37,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:37" (1/1) ... [2021-12-07 01:15:37,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:37" (1/1) ... [2021-12-07 01:15:37,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:37" (1/1) ... [2021-12-07 01:15:37,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 01:15:37,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 01:15:37,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 01:15:37,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 01:15:37,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:37" (1/1) ... [2021-12-07 01:15:37,644 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:15:37,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:15:37,663 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 01:15:37,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 01:15:37,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-07 01:15:37,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 01:15:37,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-07 01:15:37,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-07 01:15:37,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-07 01:15:37,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 01:15:37,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 01:15:37,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 01:15:37,771 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 01:15:37,772 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 01:15:38,161 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 01:15:38,166 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 01:15:38,166 INFO L301 CfgBuilder]: Removed 7 assume(true) statements. [2021-12-07 01:15:38,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:15:38 BoogieIcfgContainer [2021-12-07 01:15:38,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 01:15:38,169 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 01:15:38,169 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 01:15:38,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 01:15:38,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:15:37" (1/3) ... [2021-12-07 01:15:38,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bdd7cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:15:38, skipping insertion in model container [2021-12-07 01:15:38,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:15:37" (2/3) ... [2021-12-07 01:15:38,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bdd7cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:15:38, skipping insertion in model container [2021-12-07 01:15:38,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:15:38" (3/3) ... [2021-12-07 01:15:38,174 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.i [2021-12-07 01:15:38,177 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 01:15:38,178 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2021-12-07 01:15:38,209 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 01:15:38,214 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-07 01:15:38,214 INFO L340 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2021-12-07 01:15:38,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 105 states have (on average 2.219047619047619) internal successors, (233), 209 states have internal predecessors, (233), 0 states have call successors, (0), 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-07 01:15:38,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-07 01:15:38,232 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:38,232 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-07 01:15:38,233 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:38,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:38,236 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-07 01:15:38,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:38,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21234158] [2021-12-07 01:15:38,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:38,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:38,367 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-07 01:15:38,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:38,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21234158] [2021-12-07 01:15:38,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21234158] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:38,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:38,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:15:38,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83925506] [2021-12-07 01:15:38,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:38,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:15:38,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:38,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:15:38,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:15:38,396 INFO L87 Difference]: Start difference. First operand has 210 states, 105 states have (on average 2.219047619047619) internal successors, (233), 209 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:38,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:38,570 INFO L93 Difference]: Finished difference Result 282 states and 304 transitions. [2021-12-07 01:15:38,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:15:38,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-07 01:15:38,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:38,585 INFO L225 Difference]: With dead ends: 282 [2021-12-07 01:15:38,585 INFO L226 Difference]: Without dead ends: 278 [2021-12-07 01:15:38,587 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-07 01:15:38,590 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 200 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:38,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 199 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-12-07 01:15:38,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 199. [2021-12-07 01:15:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 104 states have (on average 2.0673076923076925) internal successors, (215), 198 states have internal predecessors, (215), 0 states have call successors, (0), 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-07 01:15:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 215 transitions. [2021-12-07 01:15:38,636 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 215 transitions. Word has length 3 [2021-12-07 01:15:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:38,636 INFO L470 AbstractCegarLoop]: Abstraction has 199 states and 215 transitions. [2021-12-07 01:15:38,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 215 transitions. [2021-12-07 01:15:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-07 01:15:38,636 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:38,637 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-07 01:15:38,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 01:15:38,637 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:38,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:38,638 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-07 01:15:38,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:38,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933222639] [2021-12-07 01:15:38,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:38,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:38,670 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-07 01:15:38,671 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:38,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933222639] [2021-12-07 01:15:38,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933222639] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:38,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:38,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:15:38,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888581695] [2021-12-07 01:15:38,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:38,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:15:38,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:38,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:15:38,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:15:38,674 INFO L87 Difference]: Start difference. First operand 199 states and 215 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:38,781 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2021-12-07 01:15:38,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:15:38,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-07 01:15:38,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:38,784 INFO L225 Difference]: With dead ends: 197 [2021-12-07 01:15:38,784 INFO L226 Difference]: Without dead ends: 197 [2021-12-07 01:15:38,784 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-07 01:15:38,785 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 2 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:38,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-07 01:15:38,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2021-12-07 01:15:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 104 states have (on average 2.048076923076923) internal successors, (213), 196 states have internal predecessors, (213), 0 states have call successors, (0), 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-07 01:15:38,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2021-12-07 01:15:38,795 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 3 [2021-12-07 01:15:38,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:38,795 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2021-12-07 01:15:38,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:38,795 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2021-12-07 01:15:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-07 01:15:38,796 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:38,796 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-07 01:15:38,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 01:15:38,796 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:38,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:38,796 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2021-12-07 01:15:38,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:38,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818941012] [2021-12-07 01:15:38,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:38,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:38,870 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-07 01:15:38,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:38,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818941012] [2021-12-07 01:15:38,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818941012] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:38,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:38,871 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:15:38,871 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138577492] [2021-12-07 01:15:38,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:38,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:15:38,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:38,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:15:38,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:15:38,873 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:39,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:39,091 INFO L93 Difference]: Finished difference Result 354 states and 382 transitions. [2021-12-07 01:15:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:15:39,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-07 01:15:39,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:39,093 INFO L225 Difference]: With dead ends: 354 [2021-12-07 01:15:39,093 INFO L226 Difference]: Without dead ends: 354 [2021-12-07 01:15:39,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:15:39,094 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 279 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:39,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 232 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:15:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-12-07 01:15:39,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 190. [2021-12-07 01:15:39,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 104 states have (on average 1.9807692307692308) internal successors, (206), 189 states have internal predecessors, (206), 0 states have call successors, (0), 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-07 01:15:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 206 transitions. [2021-12-07 01:15:39,103 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 206 transitions. Word has length 6 [2021-12-07 01:15:39,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:39,104 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 206 transitions. [2021-12-07 01:15:39,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:39,104 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 206 transitions. [2021-12-07 01:15:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-07 01:15:39,104 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:39,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:39,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 01:15:39,104 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:39,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:39,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924364, now seen corresponding path program 1 times [2021-12-07 01:15:39,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:39,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518675514] [2021-12-07 01:15:39,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:39,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:39,149 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-07 01:15:39,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:39,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518675514] [2021-12-07 01:15:39,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518675514] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:39,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:39,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:15:39,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819775385] [2021-12-07 01:15:39,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:39,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:15:39,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:39,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:15:39,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:15:39,151 INFO L87 Difference]: Start difference. First operand 190 states and 206 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:39,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:39,283 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2021-12-07 01:15:39,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:15:39,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-07 01:15:39,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:39,285 INFO L225 Difference]: With dead ends: 189 [2021-12-07 01:15:39,285 INFO L226 Difference]: Without dead ends: 189 [2021-12-07 01:15:39,285 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:15:39,287 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 5 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:39,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 508 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2021-12-07 01:15:39,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2021-12-07 01:15:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 104 states have (on average 1.9711538461538463) internal successors, (205), 188 states have internal predecessors, (205), 0 states have call successors, (0), 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-07 01:15:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 205 transitions. [2021-12-07 01:15:39,295 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 205 transitions. Word has length 10 [2021-12-07 01:15:39,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:39,295 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 205 transitions. [2021-12-07 01:15:39,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2021-12-07 01:15:39,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-07 01:15:39,296 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:39,296 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:39,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-07 01:15:39,297 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:39,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:39,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924365, now seen corresponding path program 1 times [2021-12-07 01:15:39,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:39,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286171489] [2021-12-07 01:15:39,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:39,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:39,375 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-07 01:15:39,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:39,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286171489] [2021-12-07 01:15:39,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286171489] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:39,376 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:39,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:15:39,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538651177] [2021-12-07 01:15:39,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:39,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:15:39,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:39,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:15:39,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:15:39,378 INFO L87 Difference]: Start difference. First operand 189 states and 205 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:39,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:39,526 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2021-12-07 01:15:39,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:15:39,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-07 01:15:39,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:39,528 INFO L225 Difference]: With dead ends: 188 [2021-12-07 01:15:39,528 INFO L226 Difference]: Without dead ends: 188 [2021-12-07 01:15:39,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:15:39,530 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 3 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:39,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 529 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:39,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-07 01:15:39,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-12-07 01:15:39,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 104 states have (on average 1.9615384615384615) internal successors, (204), 187 states have internal predecessors, (204), 0 states have call successors, (0), 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-07 01:15:39,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2021-12-07 01:15:39,536 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 10 [2021-12-07 01:15:39,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:39,537 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2021-12-07 01:15:39,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2021-12-07 01:15:39,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-07 01:15:39,537 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:39,538 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:39,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-07 01:15:39,538 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:39,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:39,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1114596085, now seen corresponding path program 1 times [2021-12-07 01:15:39,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:39,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541809021] [2021-12-07 01:15:39,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:39,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:39,638 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-07 01:15:39,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:39,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541809021] [2021-12-07 01:15:39,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541809021] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:39,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:39,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 01:15:39,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129345584] [2021-12-07 01:15:39,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:39,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:15:39,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:39,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:15:39,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:15:39,641 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:39,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:39,960 INFO L93 Difference]: Finished difference Result 353 states and 389 transitions. [2021-12-07 01:15:39,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:15:39,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-07 01:15:39,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:39,962 INFO L225 Difference]: With dead ends: 353 [2021-12-07 01:15:39,962 INFO L226 Difference]: Without dead ends: 353 [2021-12-07 01:15:39,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-07 01:15:39,963 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 470 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:39,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [470 Valid, 675 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:15:39,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-12-07 01:15:39,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 192. [2021-12-07 01:15:39,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 108 states have (on average 1.9444444444444444) internal successors, (210), 191 states have internal predecessors, (210), 0 states have call successors, (0), 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-07 01:15:39,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2021-12-07 01:15:39,970 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 15 [2021-12-07 01:15:39,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:39,970 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2021-12-07 01:15:39,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:39,970 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2021-12-07 01:15:39,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-07 01:15:39,971 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:39,971 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:39,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-07 01:15:39,971 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:39,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:39,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1114596086, now seen corresponding path program 1 times [2021-12-07 01:15:39,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:39,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779977377] [2021-12-07 01:15:39,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:39,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:40,073 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-07 01:15:40,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:40,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779977377] [2021-12-07 01:15:40,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779977377] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:40,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:40,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 01:15:40,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081213374] [2021-12-07 01:15:40,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:40,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:15:40,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:40,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:15:40,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:15:40,075 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:40,432 INFO L93 Difference]: Finished difference Result 347 states and 383 transitions. [2021-12-07 01:15:40,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:15:40,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-07 01:15:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:40,435 INFO L225 Difference]: With dead ends: 347 [2021-12-07 01:15:40,435 INFO L226 Difference]: Without dead ends: 347 [2021-12-07 01:15:40,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-12-07 01:15:40,436 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 452 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:40,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [452 Valid, 490 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:15:40,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-12-07 01:15:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 192. [2021-12-07 01:15:40,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 108 states have (on average 1.9351851851851851) internal successors, (209), 191 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 209 transitions. [2021-12-07 01:15:40,443 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 209 transitions. Word has length 15 [2021-12-07 01:15:40,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:40,443 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 209 transitions. [2021-12-07 01:15:40,443 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 209 transitions. [2021-12-07 01:15:40,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-07 01:15:40,444 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:40,444 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:40,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-07 01:15:40,444 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:40,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:40,445 INFO L85 PathProgramCache]: Analyzing trace with hash 192740277, now seen corresponding path program 1 times [2021-12-07 01:15:40,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:40,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546912849] [2021-12-07 01:15:40,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:40,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:40,479 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-07 01:15:40,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:40,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546912849] [2021-12-07 01:15:40,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546912849] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:40,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:40,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:15:40,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136701968] [2021-12-07 01:15:40,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:40,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:15:40,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:40,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:15:40,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:15:40,481 INFO L87 Difference]: Start difference. First operand 192 states and 209 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-07 01:15:40,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:40,588 INFO L93 Difference]: Finished difference Result 316 states and 348 transitions. [2021-12-07 01:15:40,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:15:40,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-07 01:15:40,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:40,591 INFO L225 Difference]: With dead ends: 316 [2021-12-07 01:15:40,591 INFO L226 Difference]: Without dead ends: 316 [2021-12-07 01:15:40,591 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-07 01:15:40,592 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 168 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:40,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 348 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:40,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-12-07 01:15:40,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 189. [2021-12-07 01:15:40,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 108 states have (on average 1.9074074074074074) internal successors, (206), 188 states have internal predecessors, (206), 0 states have call successors, (0), 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-07 01:15:40,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 206 transitions. [2021-12-07 01:15:40,596 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 206 transitions. Word has length 16 [2021-12-07 01:15:40,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:40,597 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 206 transitions. [2021-12-07 01:15:40,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-07 01:15:40,597 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 206 transitions. [2021-12-07 01:15:40,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-07 01:15:40,597 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:40,597 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:40,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-07 01:15:40,598 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:40,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:40,598 INFO L85 PathProgramCache]: Analyzing trace with hash 192740278, now seen corresponding path program 1 times [2021-12-07 01:15:40,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:40,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096751840] [2021-12-07 01:15:40,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:40,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:40,626 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-07 01:15:40,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:40,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096751840] [2021-12-07 01:15:40,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096751840] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:40,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:40,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:15:40,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140175867] [2021-12-07 01:15:40,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:40,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:15:40,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:40,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:15:40,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:15:40,628 INFO L87 Difference]: Start difference. First operand 189 states and 206 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-07 01:15:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:40,729 INFO L93 Difference]: Finished difference Result 293 states and 325 transitions. [2021-12-07 01:15:40,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:15:40,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-07 01:15:40,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:40,731 INFO L225 Difference]: With dead ends: 293 [2021-12-07 01:15:40,731 INFO L226 Difference]: Without dead ends: 293 [2021-12-07 01:15:40,731 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-07 01:15:40,732 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 139 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:40,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 359 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:40,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-12-07 01:15:40,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 187. [2021-12-07 01:15:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 108 states have (on average 1.8888888888888888) internal successors, (204), 186 states have internal predecessors, (204), 0 states have call successors, (0), 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-07 01:15:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 204 transitions. [2021-12-07 01:15:40,736 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 204 transitions. Word has length 16 [2021-12-07 01:15:40,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:40,736 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 204 transitions. [2021-12-07 01:15:40,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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-07 01:15:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2021-12-07 01:15:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-07 01:15:40,737 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:40,737 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:40,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-07 01:15:40,737 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:40,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:40,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1678809590, now seen corresponding path program 1 times [2021-12-07 01:15:40,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:40,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666353261] [2021-12-07 01:15:40,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:40,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:40,763 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-07 01:15:40,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:40,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666353261] [2021-12-07 01:15:40,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666353261] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:40,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:40,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:15:40,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540841844] [2021-12-07 01:15:40,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:40,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:15:40,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:40,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:15:40,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:15:40,764 INFO L87 Difference]: Start difference. First operand 187 states and 204 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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-07 01:15:40,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:40,894 INFO L93 Difference]: Finished difference Result 254 states and 278 transitions. [2021-12-07 01:15:40,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:15:40,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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-07 01:15:40,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:40,896 INFO L225 Difference]: With dead ends: 254 [2021-12-07 01:15:40,897 INFO L226 Difference]: Without dead ends: 254 [2021-12-07 01:15:40,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:15:40,898 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 327 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:40,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 153 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2021-12-07 01:15:40,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 176. [2021-12-07 01:15:40,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 175 states have internal predecessors, (197), 0 states have call successors, (0), 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-07 01:15:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2021-12-07 01:15:40,903 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 17 [2021-12-07 01:15:40,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:40,904 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2021-12-07 01:15:40,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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-07 01:15:40,904 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2021-12-07 01:15:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-07 01:15:40,904 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:40,905 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:40,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-07 01:15:40,905 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:40,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:40,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1678809591, now seen corresponding path program 1 times [2021-12-07 01:15:40,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:40,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764677157] [2021-12-07 01:15:40,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:40,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:40,955 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-07 01:15:40,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:40,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764677157] [2021-12-07 01:15:40,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764677157] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:40,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:40,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:15:40,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470214627] [2021-12-07 01:15:40,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:40,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:15:40,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:40,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:15:40,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:15:40,957 INFO L87 Difference]: Start difference. First operand 176 states and 197 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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-07 01:15:41,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:41,186 INFO L93 Difference]: Finished difference Result 438 states and 492 transitions. [2021-12-07 01:15:41,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:15:41,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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-07 01:15:41,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:41,188 INFO L225 Difference]: With dead ends: 438 [2021-12-07 01:15:41,188 INFO L226 Difference]: Without dead ends: 438 [2021-12-07 01:15:41,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:15:41,189 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 712 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:41,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [712 Valid, 293 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:15:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-12-07 01:15:41,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 318. [2021-12-07 01:15:41,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 254 states have (on average 1.7598425196850394) internal successors, (447), 317 states have internal predecessors, (447), 0 states have call successors, (0), 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-07 01:15:41,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 447 transitions. [2021-12-07 01:15:41,196 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 447 transitions. Word has length 17 [2021-12-07 01:15:41,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:41,197 INFO L470 AbstractCegarLoop]: Abstraction has 318 states and 447 transitions. [2021-12-07 01:15:41,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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-07 01:15:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 447 transitions. [2021-12-07 01:15:41,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-07 01:15:41,197 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:41,198 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:41,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-07 01:15:41,198 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:41,198 INFO L85 PathProgramCache]: Analyzing trace with hash -445669701, now seen corresponding path program 1 times [2021-12-07 01:15:41,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:41,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589425553] [2021-12-07 01:15:41,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:41,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:41,252 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-07 01:15:41,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:41,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589425553] [2021-12-07 01:15:41,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589425553] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:41,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:41,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 01:15:41,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582021819] [2021-12-07 01:15:41,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:41,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:15:41,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:41,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:15:41,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:15:41,254 INFO L87 Difference]: Start difference. First operand 318 states and 447 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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-07 01:15:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:41,634 INFO L93 Difference]: Finished difference Result 784 states and 1126 transitions. [2021-12-07 01:15:41,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 01:15:41,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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 19 [2021-12-07 01:15:41,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:41,639 INFO L225 Difference]: With dead ends: 784 [2021-12-07 01:15:41,639 INFO L226 Difference]: Without dead ends: 784 [2021-12-07 01:15:41,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-12-07 01:15:41,640 INFO L933 BasicCegarLoop]: 224 mSDtfsCounter, 363 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:41,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 1218 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:15:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2021-12-07 01:15:41,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 317. [2021-12-07 01:15:41,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 254 states have (on average 1.7559055118110236) internal successors, (446), 316 states have internal predecessors, (446), 0 states have call successors, (0), 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-07 01:15:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 446 transitions. [2021-12-07 01:15:41,652 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 446 transitions. Word has length 19 [2021-12-07 01:15:41,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:41,653 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 446 transitions. [2021-12-07 01:15:41,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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-07 01:15:41,653 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 446 transitions. [2021-12-07 01:15:41,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-07 01:15:41,654 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:41,654 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:41,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-07 01:15:41,654 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:41,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:41,654 INFO L85 PathProgramCache]: Analyzing trace with hash -445669700, now seen corresponding path program 1 times [2021-12-07 01:15:41,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:41,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916389488] [2021-12-07 01:15:41,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:41,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:41,777 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-07 01:15:41,777 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:41,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916389488] [2021-12-07 01:15:41,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916389488] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:41,778 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:41,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-07 01:15:41,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098779718] [2021-12-07 01:15:41,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:41,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-07 01:15:41,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:41,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-07 01:15:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:15:41,779 INFO L87 Difference]: Start difference. First operand 317 states and 446 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 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-07 01:15:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:42,188 INFO L93 Difference]: Finished difference Result 603 states and 842 transitions. [2021-12-07 01:15:42,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-07 01:15:42,188 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 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 19 [2021-12-07 01:15:42,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:42,192 INFO L225 Difference]: With dead ends: 603 [2021-12-07 01:15:42,192 INFO L226 Difference]: Without dead ends: 603 [2021-12-07 01:15:42,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2021-12-07 01:15:42,193 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 392 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:42,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 926 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:15:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2021-12-07 01:15:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 321. [2021-12-07 01:15:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 258 states have (on average 1.744186046511628) internal successors, (450), 320 states have internal predecessors, (450), 0 states have call successors, (0), 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-07 01:15:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 450 transitions. [2021-12-07 01:15:42,204 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 450 transitions. Word has length 19 [2021-12-07 01:15:42,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:42,204 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 450 transitions. [2021-12-07 01:15:42,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 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-07 01:15:42,205 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 450 transitions. [2021-12-07 01:15:42,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-07 01:15:42,205 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:42,205 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:42,205 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-07 01:15:42,206 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:42,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:42,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1571609538, now seen corresponding path program 1 times [2021-12-07 01:15:42,206 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:42,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134503916] [2021-12-07 01:15:42,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:42,207 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:42,227 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-07 01:15:42,227 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:42,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134503916] [2021-12-07 01:15:42,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134503916] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:42,227 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:42,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:15:42,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248222960] [2021-12-07 01:15:42,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:42,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:15:42,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:42,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:15:42,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:15:42,228 INFO L87 Difference]: Start difference. First operand 321 states and 450 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-07 01:15:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:42,243 INFO L93 Difference]: Finished difference Result 395 states and 528 transitions. [2021-12-07 01:15:42,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:15:42,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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 19 [2021-12-07 01:15:42,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:42,246 INFO L225 Difference]: With dead ends: 395 [2021-12-07 01:15:42,246 INFO L226 Difference]: Without dead ends: 395 [2021-12-07 01:15:42,247 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-07 01:15:42,247 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 163 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:42,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 296 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:15:42,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-12-07 01:15:42,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 361. [2021-12-07 01:15:42,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 360 states have internal predecessors, (528), 0 states have call successors, (0), 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-07 01:15:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 528 transitions. [2021-12-07 01:15:42,258 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 528 transitions. Word has length 19 [2021-12-07 01:15:42,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:42,258 INFO L470 AbstractCegarLoop]: Abstraction has 361 states and 528 transitions. [2021-12-07 01:15:42,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-07 01:15:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 528 transitions. [2021-12-07 01:15:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-07 01:15:42,259 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:42,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:42,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-07 01:15:42,259 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:42,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:42,260 INFO L85 PathProgramCache]: Analyzing trace with hash -727311539, now seen corresponding path program 1 times [2021-12-07 01:15:42,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:42,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901777095] [2021-12-07 01:15:42,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:42,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:42,281 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-07 01:15:42,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:42,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901777095] [2021-12-07 01:15:42,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901777095] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:42,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:42,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:15:42,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573870463] [2021-12-07 01:15:42,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:42,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:15:42,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:42,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:15:42,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:15:42,283 INFO L87 Difference]: Start difference. First operand 361 states and 528 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:42,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:42,290 INFO L93 Difference]: Finished difference Result 365 states and 532 transitions. [2021-12-07 01:15:42,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:15:42,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-07 01:15:42,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:42,292 INFO L225 Difference]: With dead ends: 365 [2021-12-07 01:15:42,292 INFO L226 Difference]: Without dead ends: 365 [2021-12-07 01:15:42,292 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-07 01:15:42,293 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:42,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:15:42,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2021-12-07 01:15:42,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2021-12-07 01:15:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 302 states have (on average 1.7615894039735098) internal successors, (532), 364 states have internal predecessors, (532), 0 states have call successors, (0), 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-07 01:15:42,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 532 transitions. [2021-12-07 01:15:42,300 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 532 transitions. Word has length 23 [2021-12-07 01:15:42,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:42,300 INFO L470 AbstractCegarLoop]: Abstraction has 365 states and 532 transitions. [2021-12-07 01:15:42,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:42,300 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 532 transitions. [2021-12-07 01:15:42,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-07 01:15:42,301 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:42,301 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:42,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-07 01:15:42,301 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:42,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:42,301 INFO L85 PathProgramCache]: Analyzing trace with hash 97933121, now seen corresponding path program 1 times [2021-12-07 01:15:42,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:42,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599961317] [2021-12-07 01:15:42,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:42,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:42,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:15:42,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:42,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599961317] [2021-12-07 01:15:42,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599961317] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:15:42,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757868209] [2021-12-07 01:15:42,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:42,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:15:42,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:15:42,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:15:42,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-07 01:15:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:42,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-07 01:15:42,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:15:42,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-07 01:15:42,560 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:15:42,561 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:15:42,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:15:42,633 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:15:42,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-07 01:15:42,664 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-07 01:15:42,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-07 01:15:42,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-07 01:15:42,821 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:15:42,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-07 01:15:42,883 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-12-07 01:15:42,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2021-12-07 01:15:42,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-07 01:15:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:15:42,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:15:43,302 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)) (.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1))) (or (= (select (store .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store .cse1 .cse2 v_ArrVal_463) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)) 1) (not (= (select .cse0 .cse2) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0)))))) is different from false [2021-12-07 01:15:43,364 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_21| Int) (v_ArrVal_464 Int) (|v_ULTIMATE.start_main_~tmpList~0#1.base_22| Int) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_460) |v_ULTIMATE.start_main_~tmpList~0#1.base_22| v_ArrVal_462))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)) (.cse0 (store |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22| 1))) (or (= (select (store .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_21| v_ArrVal_464) (select (select (store .cse1 .cse2 v_ArrVal_463) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3)) 1) (not (= (select .cse0 .cse2) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_22|) 0)) (not (= (select .cse0 |v_ULTIMATE.start_main_~tmpList~0#1.base_21|) 0))))))) is different from false [2021-12-07 01:15:43,421 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:15:43,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 70 [2021-12-07 01:15:43,427 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:15:43,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 380 treesize of output 320 [2021-12-07 01:15:43,475 INFO L354 Elim1Store]: treesize reduction 124, result has 23.0 percent of original size [2021-12-07 01:15:43,475 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 851 treesize of output 821 [2021-12-07 01:15:43,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 653 treesize of output 565 [2021-12-07 01:15:43,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 577 treesize of output 449 [2021-12-07 01:15:45,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:15:45,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757868209] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:15:45,004 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:15:45,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12] total 26 [2021-12-07 01:15:45,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414840741] [2021-12-07 01:15:45,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:15:45,005 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-07 01:15:45,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:45,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-07 01:15:45,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=489, Unknown=4, NotChecked=94, Total=702 [2021-12-07 01:15:45,005 INFO L87 Difference]: Start difference. First operand 365 states and 532 transitions. Second operand has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 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-07 01:15:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:45,301 INFO L93 Difference]: Finished difference Result 459 states and 657 transitions. [2021-12-07 01:15:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 01:15:45,302 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 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 24 [2021-12-07 01:15:45,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:45,305 INFO L225 Difference]: With dead ends: 459 [2021-12-07 01:15:45,305 INFO L226 Difference]: Without dead ends: 459 [2021-12-07 01:15:45,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=731, Unknown=4, NotChecked=118, Total=1056 [2021-12-07 01:15:45,307 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 186 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 631 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:45,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 1361 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 357 Invalid, 0 Unknown, 631 Unchecked, 0.2s Time] [2021-12-07 01:15:45,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-12-07 01:15:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 364. [2021-12-07 01:15:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 302 states have (on average 1.7582781456953642) internal successors, (531), 363 states have internal predecessors, (531), 0 states have call successors, (0), 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-07 01:15:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 531 transitions. [2021-12-07 01:15:45,318 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 531 transitions. Word has length 24 [2021-12-07 01:15:45,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:45,318 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 531 transitions. [2021-12-07 01:15:45,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 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-07 01:15:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 531 transitions. [2021-12-07 01:15:45,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-07 01:15:45,319 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:45,319 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:45,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-07 01:15:45,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-07 01:15:45,520 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:45,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:45,521 INFO L85 PathProgramCache]: Analyzing trace with hash 97933122, now seen corresponding path program 1 times [2021-12-07 01:15:45,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:45,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853036213] [2021-12-07 01:15:45,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:45,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:45,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:15:45,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:45,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853036213] [2021-12-07 01:15:45,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853036213] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:15:45,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331399667] [2021-12-07 01:15:45,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:45,849 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:15:45,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:15:45,850 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:15:45,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-07 01:15:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:45,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-07 01:15:45,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:15:45,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-07 01:15:45,946 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:15:45,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:15:45,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:15:45,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:15:46,025 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:15:46,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-07 01:15:46,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-07 01:15:46,049 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:15:46,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:15:46,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2021-12-07 01:15:46,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-07 01:15:46,193 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:15:46,193 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2021-12-07 01:15:46,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-07 01:15:46,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:15:46,221 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-07 01:15:46,226 INFO L354 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2021-12-07 01:15:46,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-07 01:15:46,249 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-07 01:15:46,252 INFO L388 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 19 treesize of output 7 [2021-12-07 01:15:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:15:46,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:15:46,407 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (or (and (forall ((v_ArrVal_564 Int) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_563) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))))) (forall ((v_ArrVal_562 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)))) is different from false [2021-12-07 01:15:46,601 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:15:46,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 162 [2021-12-07 01:15:46,607 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-07 01:15:46,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-07 01:15:46,693 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)) 0)) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_5) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_prenex_4) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))))) is different from false [2021-12-07 01:15:46,709 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)))) (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)) 0)) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (<= 0 (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_5) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_prenex_4) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3))))) is different from false [2021-12-07 01:15:47,286 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:15:47,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 161 [2021-12-07 01:15:47,293 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:15:47,293 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 121 [2021-12-07 01:15:47,296 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:15:47,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 704 treesize of output 566 [2021-12-07 01:15:47,323 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:15:47,328 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 966 treesize of output 918 [2021-12-07 01:15:47,347 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-07 01:15:47,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-07 01:15:47,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 182 [2021-12-07 01:15:47,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 170 [2021-12-07 01:15:47,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 98 [2021-12-07 01:15:47,468 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 319 treesize of output 239 [2021-12-07 01:15:47,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 207 [2021-12-07 01:15:47,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 254 [2021-12-07 01:15:47,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 114 [2021-12-07 01:15:47,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 198 [2021-12-07 01:15:47,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-07 01:15:47,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331399667] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:15:47,737 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:15:47,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 36 [2021-12-07 01:15:47,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647468448] [2021-12-07 01:15:47,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:15:47,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-07 01:15:47,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:47,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-07 01:15:47,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=971, Unknown=21, NotChecked=198, Total=1332 [2021-12-07 01:15:47,740 INFO L87 Difference]: Start difference. First operand 364 states and 531 transitions. Second operand has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 37 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-07 01:15:49,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:49,344 INFO L93 Difference]: Finished difference Result 1105 states and 1577 transitions. [2021-12-07 01:15:49,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-07 01:15:49,345 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-07 01:15:49,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:49,349 INFO L225 Difference]: With dead ends: 1105 [2021-12-07 01:15:49,349 INFO L226 Difference]: Without dead ends: 1105 [2021-12-07 01:15:49,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=352, Invalid=1709, Unknown=21, NotChecked=270, Total=2352 [2021-12-07 01:15:49,350 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 1349 mSDsluCounter, 2344 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 2507 SdHoareTripleChecker+Invalid, 4814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2269 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:49,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1349 Valid, 2507 Invalid, 4814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2456 Invalid, 0 Unknown, 2269 Unchecked, 1.0s Time] [2021-12-07 01:15:49,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2021-12-07 01:15:49,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 363. [2021-12-07 01:15:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 302 states have (on average 1.7549668874172186) internal successors, (530), 362 states have internal predecessors, (530), 0 states have call successors, (0), 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-07 01:15:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 530 transitions. [2021-12-07 01:15:49,359 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 530 transitions. Word has length 24 [2021-12-07 01:15:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:49,360 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 530 transitions. [2021-12-07 01:15:49,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 37 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-07 01:15:49,360 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 530 transitions. [2021-12-07 01:15:49,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-07 01:15:49,360 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:49,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:49,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-07 01:15:49,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-07 01:15:49,561 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:49,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:49,561 INFO L85 PathProgramCache]: Analyzing trace with hash -354718400, now seen corresponding path program 1 times [2021-12-07 01:15:49,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:49,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962254775] [2021-12-07 01:15:49,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:49,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:49,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:15:49,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:49,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962254775] [2021-12-07 01:15:49,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962254775] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:49,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:49,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:15:49,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947409149] [2021-12-07 01:15:49,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:49,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:15:49,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:49,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:15:49,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:15:49,582 INFO L87 Difference]: Start difference. First operand 363 states and 530 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-07 01:15:49,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:49,587 INFO L93 Difference]: Finished difference Result 366 states and 533 transitions. [2021-12-07 01:15:49,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:15:49,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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 24 [2021-12-07 01:15:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:49,589 INFO L225 Difference]: With dead ends: 366 [2021-12-07 01:15:49,589 INFO L226 Difference]: Without dead ends: 366 [2021-12-07 01:15:49,589 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-07 01:15:49,590 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:49,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 354 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:15:49,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-12-07 01:15:49,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2021-12-07 01:15:49,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 305 states have (on average 1.7475409836065574) internal successors, (533), 365 states have internal predecessors, (533), 0 states have call successors, (0), 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-07 01:15:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 533 transitions. [2021-12-07 01:15:49,595 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 533 transitions. Word has length 24 [2021-12-07 01:15:49,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:49,596 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 533 transitions. [2021-12-07 01:15:49,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-07 01:15:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 533 transitions. [2021-12-07 01:15:49,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-07 01:15:49,596 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:49,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:49,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-07 01:15:49,596 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:49,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:49,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1183191976, now seen corresponding path program 1 times [2021-12-07 01:15:49,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:49,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218953932] [2021-12-07 01:15:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:49,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:49,619 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-07 01:15:49,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:49,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218953932] [2021-12-07 01:15:49,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218953932] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:49,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:49,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:15:49,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842788943] [2021-12-07 01:15:49,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:49,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:15:49,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:49,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:15:49,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:15:49,620 INFO L87 Difference]: Start difference. First operand 366 states and 533 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:49,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:49,632 INFO L93 Difference]: Finished difference Result 409 states and 562 transitions. [2021-12-07 01:15:49,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:15:49,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-07 01:15:49,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:49,634 INFO L225 Difference]: With dead ends: 409 [2021-12-07 01:15:49,634 INFO L226 Difference]: Without dead ends: 409 [2021-12-07 01:15:49,634 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-07 01:15:49,635 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 52 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:49,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 351 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:15:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2021-12-07 01:15:49,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 355. [2021-12-07 01:15:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 294 states have (on average 1.7312925170068028) internal successors, (509), 354 states have internal predecessors, (509), 0 states have call successors, (0), 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-07 01:15:49,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 509 transitions. [2021-12-07 01:15:49,641 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 509 transitions. Word has length 25 [2021-12-07 01:15:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:49,641 INFO L470 AbstractCegarLoop]: Abstraction has 355 states and 509 transitions. [2021-12-07 01:15:49,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 509 transitions. [2021-12-07 01:15:49,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-07 01:15:49,641 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:49,641 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:49,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-07 01:15:49,642 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:49,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:49,642 INFO L85 PathProgramCache]: Analyzing trace with hash 808555227, now seen corresponding path program 1 times [2021-12-07 01:15:49,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:49,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535607633] [2021-12-07 01:15:49,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:49,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:49,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:15:49,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:49,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535607633] [2021-12-07 01:15:49,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535607633] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:49,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:49,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 01:15:49,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842808955] [2021-12-07 01:15:49,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:49,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:15:49,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:49,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:15:49,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:15:49,730 INFO L87 Difference]: Start difference. First operand 355 states and 509 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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-07 01:15:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:50,130 INFO L93 Difference]: Finished difference Result 615 states and 802 transitions. [2021-12-07 01:15:50,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-07 01:15:50,131 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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-07 01:15:50,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:50,133 INFO L225 Difference]: With dead ends: 615 [2021-12-07 01:15:50,133 INFO L226 Difference]: Without dead ends: 615 [2021-12-07 01:15:50,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-12-07 01:15:50,134 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 445 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:50,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [445 Valid, 1258 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:15:50,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-12-07 01:15:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 440. [2021-12-07 01:15:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 379 states have (on average 1.7097625329815302) internal successors, (648), 439 states have internal predecessors, (648), 0 states have call successors, (0), 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-07 01:15:50,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 648 transitions. [2021-12-07 01:15:50,145 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 648 transitions. Word has length 26 [2021-12-07 01:15:50,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:50,145 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 648 transitions. [2021-12-07 01:15:50,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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-07 01:15:50,145 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 648 transitions. [2021-12-07 01:15:50,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-07 01:15:50,146 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:50,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:50,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-07 01:15:50,146 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:50,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:50,147 INFO L85 PathProgramCache]: Analyzing trace with hash -645242845, now seen corresponding path program 1 times [2021-12-07 01:15:50,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:50,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066629488] [2021-12-07 01:15:50,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:50,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:15:50,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:50,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066629488] [2021-12-07 01:15:50,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066629488] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:50,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:50,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 01:15:50,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241229266] [2021-12-07 01:15:50,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:50,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:15:50,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:50,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:15:50,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:15:50,243 INFO L87 Difference]: Start difference. First operand 440 states and 648 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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-07 01:15:50,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:50,578 INFO L93 Difference]: Finished difference Result 575 states and 752 transitions. [2021-12-07 01:15:50,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-07 01:15:50,578 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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-07 01:15:50,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:50,580 INFO L225 Difference]: With dead ends: 575 [2021-12-07 01:15:50,580 INFO L226 Difference]: Without dead ends: 575 [2021-12-07 01:15:50,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2021-12-07 01:15:50,581 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 437 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:50,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 927 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:15:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-12-07 01:15:50,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 413. [2021-12-07 01:15:50,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 352 states have (on average 1.7159090909090908) internal successors, (604), 412 states have internal predecessors, (604), 0 states have call successors, (0), 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-07 01:15:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 604 transitions. [2021-12-07 01:15:50,588 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 604 transitions. Word has length 26 [2021-12-07 01:15:50,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:50,588 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 604 transitions. [2021-12-07 01:15:50,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 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-07 01:15:50,588 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 604 transitions. [2021-12-07 01:15:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-07 01:15:50,588 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:50,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:50,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-07 01:15:50,589 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:50,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:50,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1118310097, now seen corresponding path program 1 times [2021-12-07 01:15:50,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:50,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261534804] [2021-12-07 01:15:50,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:50,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:50,669 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-07 01:15:50,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:50,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261534804] [2021-12-07 01:15:50,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261534804] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:50,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:50,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 01:15:50,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471822325] [2021-12-07 01:15:50,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:50,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:15:50,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:50,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:15:50,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:15:50,671 INFO L87 Difference]: Start difference. First operand 413 states and 604 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-07 01:15:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:51,058 INFO L93 Difference]: Finished difference Result 614 states and 871 transitions. [2021-12-07 01:15:51,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-07 01:15:51,059 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-07 01:15:51,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:51,061 INFO L225 Difference]: With dead ends: 614 [2021-12-07 01:15:51,061 INFO L226 Difference]: Without dead ends: 614 [2021-12-07 01:15:51,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2021-12-07 01:15:51,062 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 509 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:51,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 875 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:15:51,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-12-07 01:15:51,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 422. [2021-12-07 01:15:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 361 states have (on average 1.703601108033241) internal successors, (615), 421 states have internal predecessors, (615), 0 states have call successors, (0), 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-07 01:15:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 615 transitions. [2021-12-07 01:15:51,068 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 615 transitions. Word has length 27 [2021-12-07 01:15:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:51,068 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 615 transitions. [2021-12-07 01:15:51,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-07 01:15:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 615 transitions. [2021-12-07 01:15:51,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-07 01:15:51,068 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:51,068 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:51,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-07 01:15:51,069 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:51,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:51,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1118310096, now seen corresponding path program 1 times [2021-12-07 01:15:51,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:51,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714219642] [2021-12-07 01:15:51,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:51,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:51,164 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-07 01:15:51,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:51,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714219642] [2021-12-07 01:15:51,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714219642] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:51,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:51,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 01:15:51,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052054850] [2021-12-07 01:15:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:51,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:15:51,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:51,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:15:51,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:15:51,165 INFO L87 Difference]: Start difference. First operand 422 states and 615 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-07 01:15:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:51,648 INFO L93 Difference]: Finished difference Result 617 states and 874 transitions. [2021-12-07 01:15:51,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:15:51,648 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-07 01:15:51,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:51,652 INFO L225 Difference]: With dead ends: 617 [2021-12-07 01:15:51,652 INFO L226 Difference]: Without dead ends: 617 [2021-12-07 01:15:51,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2021-12-07 01:15:51,653 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 453 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:51,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [453 Valid, 649 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:15:51,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-12-07 01:15:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 422. [2021-12-07 01:15:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 361 states have (on average 1.700831024930748) internal successors, (614), 421 states have internal predecessors, (614), 0 states have call successors, (0), 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-07 01:15:51,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 614 transitions. [2021-12-07 01:15:51,662 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 614 transitions. Word has length 27 [2021-12-07 01:15:51,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:51,662 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 614 transitions. [2021-12-07 01:15:51,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 10 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-07 01:15:51,662 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 614 transitions. [2021-12-07 01:15:51,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-07 01:15:51,663 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:51,663 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:51,663 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-07 01:15:51,663 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:51,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash -114590158, now seen corresponding path program 1 times [2021-12-07 01:15:51,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:51,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90762901] [2021-12-07 01:15:51,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:51,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:51,689 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-07 01:15:51,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:51,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90762901] [2021-12-07 01:15:51,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90762901] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:51,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:51,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:15:51,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381600802] [2021-12-07 01:15:51,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:51,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:15:51,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:51,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:15:51,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:15:51,690 INFO L87 Difference]: Start difference. First operand 422 states and 614 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-07 01:15:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:51,697 INFO L93 Difference]: Finished difference Result 426 states and 618 transitions. [2021-12-07 01:15:51,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:15:51,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-07 01:15:51,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:51,700 INFO L225 Difference]: With dead ends: 426 [2021-12-07 01:15:51,700 INFO L226 Difference]: Without dead ends: 426 [2021-12-07 01:15:51,700 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-07 01:15:51,701 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:51,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:15:51,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2021-12-07 01:15:51,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2021-12-07 01:15:51,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 365 states have (on average 1.6931506849315068) internal successors, (618), 425 states have internal predecessors, (618), 0 states have call successors, (0), 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-07 01:15:51,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 618 transitions. [2021-12-07 01:15:51,709 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 618 transitions. Word has length 27 [2021-12-07 01:15:51,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:51,709 INFO L470 AbstractCegarLoop]: Abstraction has 426 states and 618 transitions. [2021-12-07 01:15:51,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-07 01:15:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 618 transitions. [2021-12-07 01:15:51,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-07 01:15:51,710 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:51,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:51,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-07 01:15:51,710 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:51,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:51,711 INFO L85 PathProgramCache]: Analyzing trace with hash -114649740, now seen corresponding path program 1 times [2021-12-07 01:15:51,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:51,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529675200] [2021-12-07 01:15:51,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:51,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:51,738 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-07 01:15:51,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:51,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529675200] [2021-12-07 01:15:51,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529675200] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:51,738 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:51,738 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:15:51,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083853506] [2021-12-07 01:15:51,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:51,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:15:51,739 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:51,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:15:51,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:15:51,739 INFO L87 Difference]: Start difference. First operand 426 states and 618 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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-07 01:15:51,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:51,821 INFO L93 Difference]: Finished difference Result 628 states and 919 transitions. [2021-12-07 01:15:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:15:51,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-07 01:15:51,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:51,824 INFO L225 Difference]: With dead ends: 628 [2021-12-07 01:15:51,824 INFO L226 Difference]: Without dead ends: 628 [2021-12-07 01:15:51,825 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-07 01:15:51,825 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 124 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:51,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 301 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2021-12-07 01:15:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 421. [2021-12-07 01:15:51,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 365 states have (on average 1.6794520547945206) internal successors, (613), 420 states have internal predecessors, (613), 0 states have call successors, (0), 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-07 01:15:51,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 613 transitions. [2021-12-07 01:15:51,834 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 613 transitions. Word has length 27 [2021-12-07 01:15:51,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:51,834 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 613 transitions. [2021-12-07 01:15:51,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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-07 01:15:51,835 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 613 transitions. [2021-12-07 01:15:51,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-07 01:15:51,835 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:51,835 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:51,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-07 01:15:51,836 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:51,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:51,836 INFO L85 PathProgramCache]: Analyzing trace with hash -114649739, now seen corresponding path program 1 times [2021-12-07 01:15:51,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:51,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999640612] [2021-12-07 01:15:51,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:51,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:51,864 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-07 01:15:51,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:51,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999640612] [2021-12-07 01:15:51,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999640612] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:51,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:51,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:15:51,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239784521] [2021-12-07 01:15:51,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:51,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:15:51,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:51,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:15:51,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:15:51,867 INFO L87 Difference]: Start difference. First operand 421 states and 613 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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-07 01:15:51,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:51,946 INFO L93 Difference]: Finished difference Result 419 states and 611 transitions. [2021-12-07 01:15:51,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:15:51,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-07 01:15:51,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:51,948 INFO L225 Difference]: With dead ends: 419 [2021-12-07 01:15:51,948 INFO L226 Difference]: Without dead ends: 419 [2021-12-07 01:15:51,948 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-07 01:15:51,949 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 5 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:51,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 253 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:51,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-12-07 01:15:51,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2021-12-07 01:15:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 365 states have (on average 1.673972602739726) internal successors, (611), 418 states have internal predecessors, (611), 0 states have call successors, (0), 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-07 01:15:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 611 transitions. [2021-12-07 01:15:51,957 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 611 transitions. Word has length 27 [2021-12-07 01:15:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:51,957 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 611 transitions. [2021-12-07 01:15:51,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 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-07 01:15:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 611 transitions. [2021-12-07 01:15:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-07 01:15:51,958 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:51,958 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:51,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-07 01:15:51,958 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:51,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:51,958 INFO L85 PathProgramCache]: Analyzing trace with hash -127169272, now seen corresponding path program 1 times [2021-12-07 01:15:51,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:51,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540710359] [2021-12-07 01:15:51,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:51,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:15:52,049 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:52,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540710359] [2021-12-07 01:15:52,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540710359] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:15:52,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505429517] [2021-12-07 01:15:52,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:52,050 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:15:52,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:15:52,050 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:15:52,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-07 01:15:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:52,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-07 01:15:52,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:15:52,161 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:15:52,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:15:52,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2021-12-07 01:15:52,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2021-12-07 01:15:52,196 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2021-12-07 01:15:52,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2021-12-07 01:15:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:15:52,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:15:52,218 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int))) (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_942) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))))) (forall ((v_ArrVal_942 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_942) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))))) is different from false [2021-12-07 01:15:52,237 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:15:52,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 50 [2021-12-07 01:15:52,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2021-12-07 01:15:52,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 53 [2021-12-07 01:15:52,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2021-12-07 01:15:52,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2021-12-07 01:15:52,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2021-12-07 01:15:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-07 01:15:52,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505429517] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:15:52,341 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:15:52,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2021-12-07 01:15:52,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203059070] [2021-12-07 01:15:52,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:15:52,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 01:15:52,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:52,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 01:15:52,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2021-12-07 01:15:52,342 INFO L87 Difference]: Start difference. First operand 419 states and 611 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 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-07 01:15:52,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:52,748 INFO L93 Difference]: Finished difference Result 880 states and 1268 transitions. [2021-12-07 01:15:52,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 01:15:52,749 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 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-07 01:15:52,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:52,752 INFO L225 Difference]: With dead ends: 880 [2021-12-07 01:15:52,752 INFO L226 Difference]: Without dead ends: 880 [2021-12-07 01:15:52,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=176, Unknown=1, NotChecked=28, Total=272 [2021-12-07 01:15:52,753 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 330 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 473 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:52,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [330 Valid, 1223 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 831 Invalid, 0 Unknown, 473 Unchecked, 0.3s Time] [2021-12-07 01:15:52,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2021-12-07 01:15:52,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 412. [2021-12-07 01:15:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 359 states have (on average 1.682451253481894) internal successors, (604), 411 states have internal predecessors, (604), 0 states have call successors, (0), 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-07 01:15:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 604 transitions. [2021-12-07 01:15:52,759 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 604 transitions. Word has length 28 [2021-12-07 01:15:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:52,759 INFO L470 AbstractCegarLoop]: Abstraction has 412 states and 604 transitions. [2021-12-07 01:15:52,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 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-07 01:15:52,760 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 604 transitions. [2021-12-07 01:15:52,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-07 01:15:52,760 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:52,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:52,780 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-07 01:15:52,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-12-07 01:15:52,961 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:52,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:52,962 INFO L85 PathProgramCache]: Analyzing trace with hash -287836000, now seen corresponding path program 1 times [2021-12-07 01:15:52,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:52,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592079908] [2021-12-07 01:15:52,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:52,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:15:53,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:53,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592079908] [2021-12-07 01:15:53,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592079908] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:53,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:53,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:15:53,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077876887] [2021-12-07 01:15:53,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:53,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:15:53,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:53,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:15:53,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:15:53,042 INFO L87 Difference]: Start difference. First operand 412 states and 604 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:53,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:53,192 INFO L93 Difference]: Finished difference Result 519 states and 766 transitions. [2021-12-07 01:15:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:15:53,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-07 01:15:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:53,194 INFO L225 Difference]: With dead ends: 519 [2021-12-07 01:15:53,194 INFO L226 Difference]: Without dead ends: 519 [2021-12-07 01:15:53,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:15:53,195 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 66 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:53,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 513 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:53,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-12-07 01:15:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 421. [2021-12-07 01:15:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 368 states have (on average 1.673913043478261) internal successors, (616), 420 states have internal predecessors, (616), 0 states have call successors, (0), 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-07 01:15:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 616 transitions. [2021-12-07 01:15:53,200 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 616 transitions. Word has length 28 [2021-12-07 01:15:53,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:53,200 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 616 transitions. [2021-12-07 01:15:53,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:53,200 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 616 transitions. [2021-12-07 01:15:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-07 01:15:53,200 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:53,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:53,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-07 01:15:53,201 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:53,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:53,201 INFO L85 PathProgramCache]: Analyzing trace with hash -287651302, now seen corresponding path program 1 times [2021-12-07 01:15:53,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:53,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261081743] [2021-12-07 01:15:53,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:53,201 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:53,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:15:53,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:53,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261081743] [2021-12-07 01:15:53,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261081743] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:53,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:53,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-07 01:15:53,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378307272] [2021-12-07 01:15:53,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:53,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 01:15:53,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:53,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 01:15:53,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:15:53,297 INFO L87 Difference]: Start difference. First operand 421 states and 616 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:53,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:53,639 INFO L93 Difference]: Finished difference Result 547 states and 761 transitions. [2021-12-07 01:15:53,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-07 01:15:53,639 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-07 01:15:53,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:53,641 INFO L225 Difference]: With dead ends: 547 [2021-12-07 01:15:53,641 INFO L226 Difference]: Without dead ends: 547 [2021-12-07 01:15:53,641 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2021-12-07 01:15:53,642 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 265 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:53,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [265 Valid, 883 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:15:53,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2021-12-07 01:15:53,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 380. [2021-12-07 01:15:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 327 states have (on average 1.657492354740061) internal successors, (542), 379 states have internal predecessors, (542), 0 states have call successors, (0), 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-07 01:15:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 542 transitions. [2021-12-07 01:15:53,648 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 542 transitions. Word has length 28 [2021-12-07 01:15:53,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:53,648 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 542 transitions. [2021-12-07 01:15:53,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:53,649 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 542 transitions. [2021-12-07 01:15:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-07 01:15:53,649 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:53,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:53,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-07 01:15:53,649 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:53,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:53,649 INFO L85 PathProgramCache]: Analyzing trace with hash 485465518, now seen corresponding path program 1 times [2021-12-07 01:15:53,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:53,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911627706] [2021-12-07 01:15:53,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:53,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:53,726 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-07 01:15:53,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:53,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911627706] [2021-12-07 01:15:53,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911627706] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:53,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:53,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 01:15:53,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193881207] [2021-12-07 01:15:53,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:53,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:15:53,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:53,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:15:53,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:15:53,728 INFO L87 Difference]: Start difference. First operand 380 states and 542 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 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-07 01:15:54,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:54,034 INFO L93 Difference]: Finished difference Result 546 states and 760 transitions. [2021-12-07 01:15:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-07 01:15:54,035 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 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 30 [2021-12-07 01:15:54,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:54,037 INFO L225 Difference]: With dead ends: 546 [2021-12-07 01:15:54,037 INFO L226 Difference]: Without dead ends: 546 [2021-12-07 01:15:54,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2021-12-07 01:15:54,038 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 407 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:54,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 647 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:15:54,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2021-12-07 01:15:54,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 383. [2021-12-07 01:15:54,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 330 states have (on average 1.6545454545454545) internal successors, (546), 382 states have internal predecessors, (546), 0 states have call successors, (0), 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-07 01:15:54,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 546 transitions. [2021-12-07 01:15:54,042 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 546 transitions. Word has length 30 [2021-12-07 01:15:54,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:54,043 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 546 transitions. [2021-12-07 01:15:54,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 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-07 01:15:54,043 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 546 transitions. [2021-12-07 01:15:54,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-07 01:15:54,043 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:54,043 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:54,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-07 01:15:54,043 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:54,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:54,044 INFO L85 PathProgramCache]: Analyzing trace with hash 485466609, now seen corresponding path program 1 times [2021-12-07 01:15:54,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:54,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24725702] [2021-12-07 01:15:54,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:54,044 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:54,073 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-07 01:15:54,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:54,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24725702] [2021-12-07 01:15:54,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24725702] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:54,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:54,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:15:54,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551297197] [2021-12-07 01:15:54,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:54,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:15:54,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:54,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:15:54,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:15:54,074 INFO L87 Difference]: Start difference. First operand 383 states and 546 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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-07 01:15:54,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:54,213 INFO L93 Difference]: Finished difference Result 382 states and 542 transitions. [2021-12-07 01:15:54,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:15:54,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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 30 [2021-12-07 01:15:54,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:54,215 INFO L225 Difference]: With dead ends: 382 [2021-12-07 01:15:54,215 INFO L226 Difference]: Without dead ends: 382 [2021-12-07 01:15:54,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:15:54,216 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 25 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:54,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 384 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:54,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-12-07 01:15:54,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2021-12-07 01:15:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 330 states have (on average 1.6424242424242423) internal successors, (542), 381 states have internal predecessors, (542), 0 states have call successors, (0), 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-07 01:15:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 542 transitions. [2021-12-07 01:15:54,220 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 542 transitions. Word has length 30 [2021-12-07 01:15:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:54,221 INFO L470 AbstractCegarLoop]: Abstraction has 382 states and 542 transitions. [2021-12-07 01:15:54,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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-07 01:15:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 542 transitions. [2021-12-07 01:15:54,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-07 01:15:54,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:54,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:54,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-07 01:15:54,222 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:54,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:54,222 INFO L85 PathProgramCache]: Analyzing trace with hash 485466610, now seen corresponding path program 1 times [2021-12-07 01:15:54,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:54,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884721764] [2021-12-07 01:15:54,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:54,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:54,264 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-07 01:15:54,264 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:54,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884721764] [2021-12-07 01:15:54,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884721764] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:54,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:54,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:15:54,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711944585] [2021-12-07 01:15:54,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:54,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:15:54,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:54,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:15:54,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:15:54,265 INFO L87 Difference]: Start difference. First operand 382 states and 542 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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-07 01:15:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:54,419 INFO L93 Difference]: Finished difference Result 381 states and 538 transitions. [2021-12-07 01:15:54,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:15:54,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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 30 [2021-12-07 01:15:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:54,420 INFO L225 Difference]: With dead ends: 381 [2021-12-07 01:15:54,420 INFO L226 Difference]: Without dead ends: 381 [2021-12-07 01:15:54,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:15:54,421 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 33 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:54,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 365 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:54,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-12-07 01:15:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2021-12-07 01:15:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 330 states have (on average 1.6303030303030304) internal successors, (538), 380 states have internal predecessors, (538), 0 states have call successors, (0), 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-07 01:15:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 538 transitions. [2021-12-07 01:15:54,426 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 538 transitions. Word has length 30 [2021-12-07 01:15:54,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:54,426 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 538 transitions. [2021-12-07 01:15:54,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 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-07 01:15:54,427 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 538 transitions. [2021-12-07 01:15:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-07 01:15:54,427 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:54,427 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:54,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-07 01:15:54,427 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:54,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:54,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1031290720, now seen corresponding path program 1 times [2021-12-07 01:15:54,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:54,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38899794] [2021-12-07 01:15:54,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:54,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:54,468 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-07 01:15:54,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:54,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38899794] [2021-12-07 01:15:54,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38899794] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:54,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:54,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:15:54,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474366379] [2021-12-07 01:15:54,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:54,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:15:54,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:54,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:15:54,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:15:54,470 INFO L87 Difference]: Start difference. First operand 381 states and 538 transitions. Second operand has 4 states, 3 states have (on average 10.0) 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-07 01:15:54,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:54,619 INFO L93 Difference]: Finished difference Result 800 states and 1167 transitions. [2021-12-07 01:15:54,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:15:54,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) 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 30 [2021-12-07 01:15:54,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:54,623 INFO L225 Difference]: With dead ends: 800 [2021-12-07 01:15:54,623 INFO L226 Difference]: Without dead ends: 800 [2021-12-07 01:15:54,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:15:54,624 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 198 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:54,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 367 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:54,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2021-12-07 01:15:54,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 378. [2021-12-07 01:15:54,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 330 states have (on average 1.621212121212121) internal successors, (535), 377 states have internal predecessors, (535), 0 states have call successors, (0), 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-07 01:15:54,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 535 transitions. [2021-12-07 01:15:54,629 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 535 transitions. Word has length 30 [2021-12-07 01:15:54,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:54,630 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 535 transitions. [2021-12-07 01:15:54,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) 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-07 01:15:54,630 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 535 transitions. [2021-12-07 01:15:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-07 01:15:54,630 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:54,630 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:54,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-07 01:15:54,630 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:54,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:54,630 INFO L85 PathProgramCache]: Analyzing trace with hash -2130437780, now seen corresponding path program 1 times [2021-12-07 01:15:54,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:54,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608334882] [2021-12-07 01:15:54,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:54,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:54,698 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-07 01:15:54,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:54,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608334882] [2021-12-07 01:15:54,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608334882] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:54,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:54,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:15:54,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968846649] [2021-12-07 01:15:54,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:54,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 01:15:54,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:54,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 01:15:54,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:15:54,700 INFO L87 Difference]: Start difference. First operand 378 states and 535 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:55,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:55,021 INFO L93 Difference]: Finished difference Result 532 states and 738 transitions. [2021-12-07 01:15:55,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 01:15:55,021 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-07 01:15:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:55,023 INFO L225 Difference]: With dead ends: 532 [2021-12-07 01:15:55,023 INFO L226 Difference]: Without dead ends: 532 [2021-12-07 01:15:55,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2021-12-07 01:15:55,024 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 251 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:55,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 769 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:15:55,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2021-12-07 01:15:55,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 379. [2021-12-07 01:15:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 331 states have (on average 1.6193353474320242) internal successors, (536), 378 states have internal predecessors, (536), 0 states have call successors, (0), 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-07 01:15:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 536 transitions. [2021-12-07 01:15:55,028 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 536 transitions. Word has length 31 [2021-12-07 01:15:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:55,028 INFO L470 AbstractCegarLoop]: Abstraction has 379 states and 536 transitions. [2021-12-07 01:15:55,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 536 transitions. [2021-12-07 01:15:55,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-07 01:15:55,029 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:55,029 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:55,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-07 01:15:55,029 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr99ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:55,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:55,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1619061392, now seen corresponding path program 1 times [2021-12-07 01:15:55,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:55,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40178613] [2021-12-07 01:15:55,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:55,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,058 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-07 01:15:55,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:55,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40178613] [2021-12-07 01:15:55,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40178613] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:55,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:55,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:15:55,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396521264] [2021-12-07 01:15:55,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:55,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:15:55,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:55,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:15:55,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:15:55,059 INFO L87 Difference]: Start difference. First operand 379 states and 536 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:55,172 INFO L93 Difference]: Finished difference Result 378 states and 532 transitions. [2021-12-07 01:15:55,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:15:55,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-07 01:15:55,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:55,173 INFO L225 Difference]: With dead ends: 378 [2021-12-07 01:15:55,173 INFO L226 Difference]: Without dead ends: 378 [2021-12-07 01:15:55,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:15:55,174 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 23 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:55,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 365 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2021-12-07 01:15:55,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2021-12-07 01:15:55,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 331 states have (on average 1.607250755287009) internal successors, (532), 377 states have internal predecessors, (532), 0 states have call successors, (0), 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-07 01:15:55,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 532 transitions. [2021-12-07 01:15:55,178 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 532 transitions. Word has length 32 [2021-12-07 01:15:55,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:55,178 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 532 transitions. [2021-12-07 01:15:55,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:55,178 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 532 transitions. [2021-12-07 01:15:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-07 01:15:55,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:55,179 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:55,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-07 01:15:55,179 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:55,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1381121302, now seen corresponding path program 1 times [2021-12-07 01:15:55,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:55,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199026350] [2021-12-07 01:15:55,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:55,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,288 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-07 01:15:55,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:55,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199026350] [2021-12-07 01:15:55,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199026350] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:55,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:55,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-07 01:15:55,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816111314] [2021-12-07 01:15:55,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:55,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-07 01:15:55,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:55,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-07 01:15:55,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-12-07 01:15:55,289 INFO L87 Difference]: Start difference. First operand 378 states and 532 transitions. Second operand has 16 states, 15 states have (on average 2.2) internal successors, (33), 16 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-07 01:15:55,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:55,870 INFO L93 Difference]: Finished difference Result 666 states and 895 transitions. [2021-12-07 01:15:55,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-07 01:15:55,870 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 16 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 33 [2021-12-07 01:15:55,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:55,872 INFO L225 Difference]: With dead ends: 666 [2021-12-07 01:15:55,872 INFO L226 Difference]: Without dead ends: 666 [2021-12-07 01:15:55,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2021-12-07 01:15:55,873 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 515 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:55,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [515 Valid, 1264 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-07 01:15:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2021-12-07 01:15:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 383. [2021-12-07 01:15:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 336 states have (on average 1.6011904761904763) internal successors, (538), 382 states have internal predecessors, (538), 0 states have call successors, (0), 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-07 01:15:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 538 transitions. [2021-12-07 01:15:55,878 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 538 transitions. Word has length 33 [2021-12-07 01:15:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:55,878 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 538 transitions. [2021-12-07 01:15:55,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2) internal successors, (33), 16 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-07 01:15:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 538 transitions. [2021-12-07 01:15:55,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-07 01:15:55,879 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:55,879 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:55,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-07 01:15:55,879 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:55,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:55,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1381121303, now seen corresponding path program 1 times [2021-12-07 01:15:55,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:55,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018344134] [2021-12-07 01:15:55,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:55,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:55,975 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-07 01:15:55,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:55,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018344134] [2021-12-07 01:15:55,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018344134] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:55,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:55,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-07 01:15:55,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171004749] [2021-12-07 01:15:55,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:55,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-07 01:15:55,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:55,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-07 01:15:55,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:15:55,976 INFO L87 Difference]: Start difference. First operand 383 states and 538 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 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-07 01:15:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:56,378 INFO L93 Difference]: Finished difference Result 518 states and 719 transitions. [2021-12-07 01:15:56,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-07 01:15:56,378 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 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 33 [2021-12-07 01:15:56,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:56,380 INFO L225 Difference]: With dead ends: 518 [2021-12-07 01:15:56,380 INFO L226 Difference]: Without dead ends: 518 [2021-12-07 01:15:56,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2021-12-07 01:15:56,381 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 267 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:56,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 1035 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:15:56,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-12-07 01:15:56,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 378. [2021-12-07 01:15:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 331 states have (on average 1.6042296072507554) internal successors, (531), 377 states have internal predecessors, (531), 0 states have call successors, (0), 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-07 01:15:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 531 transitions. [2021-12-07 01:15:56,385 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 531 transitions. Word has length 33 [2021-12-07 01:15:56,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:56,385 INFO L470 AbstractCegarLoop]: Abstraction has 378 states and 531 transitions. [2021-12-07 01:15:56,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 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-07 01:15:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 531 transitions. [2021-12-07 01:15:56,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-07 01:15:56,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:56,386 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:56,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-07 01:15:56,386 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr101ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:56,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:56,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1139825358, now seen corresponding path program 1 times [2021-12-07 01:15:56,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:56,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960653558] [2021-12-07 01:15:56,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:56,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:56,406 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-07 01:15:56,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:56,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960653558] [2021-12-07 01:15:56,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960653558] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:56,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:56,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:15:56,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748549955] [2021-12-07 01:15:56,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:56,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:15:56,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:56,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:15:56,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:15:56,408 INFO L87 Difference]: Start difference. First operand 378 states and 531 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:56,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:56,514 INFO L93 Difference]: Finished difference Result 535 states and 669 transitions. [2021-12-07 01:15:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:15:56,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-07 01:15:56,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:56,516 INFO L225 Difference]: With dead ends: 535 [2021-12-07 01:15:56,516 INFO L226 Difference]: Without dead ends: 535 [2021-12-07 01:15:56,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:15:56,517 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 326 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:56,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 336 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:56,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-12-07 01:15:56,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 400. [2021-12-07 01:15:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 353 states have (on average 1.6203966005665722) internal successors, (572), 399 states have internal predecessors, (572), 0 states have call successors, (0), 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-07 01:15:56,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 572 transitions. [2021-12-07 01:15:56,522 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 572 transitions. Word has length 34 [2021-12-07 01:15:56,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:56,522 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 572 transitions. [2021-12-07 01:15:56,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 572 transitions. [2021-12-07 01:15:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-07 01:15:56,522 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:56,523 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:56,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-07 01:15:56,523 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:56,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:56,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1046400092, now seen corresponding path program 1 times [2021-12-07 01:15:56,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:56,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618530800] [2021-12-07 01:15:56,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:56,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:56,557 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-07 01:15:56,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:56,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618530800] [2021-12-07 01:15:56,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618530800] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:56,557 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:56,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:15:56,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667210393] [2021-12-07 01:15:56,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:56,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:15:56,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:56,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:15:56,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:15:56,558 INFO L87 Difference]: Start difference. First operand 400 states and 572 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:56,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:56,677 INFO L93 Difference]: Finished difference Result 399 states and 571 transitions. [2021-12-07 01:15:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:15:56,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-07 01:15:56,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:56,679 INFO L225 Difference]: With dead ends: 399 [2021-12-07 01:15:56,679 INFO L226 Difference]: Without dead ends: 399 [2021-12-07 01:15:56,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:15:56,679 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 5 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:56,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 409 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2021-12-07 01:15:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2021-12-07 01:15:56,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 353 states have (on average 1.6175637393767706) internal successors, (571), 398 states have internal predecessors, (571), 0 states have call successors, (0), 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-07 01:15:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 571 transitions. [2021-12-07 01:15:56,684 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 571 transitions. Word has length 34 [2021-12-07 01:15:56,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:56,684 INFO L470 AbstractCegarLoop]: Abstraction has 399 states and 571 transitions. [2021-12-07 01:15:56,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:56,684 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 571 transitions. [2021-12-07 01:15:56,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-07 01:15:56,684 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:56,684 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:56,684 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-07 01:15:56,684 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:56,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:56,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1046400093, now seen corresponding path program 1 times [2021-12-07 01:15:56,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:56,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113096408] [2021-12-07 01:15:56,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:56,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:56,710 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-07 01:15:56,710 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:56,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113096408] [2021-12-07 01:15:56,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113096408] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:15:56,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:15:56,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:15:56,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832843231] [2021-12-07 01:15:56,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:15:56,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:15:56,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:56,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:15:56,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:15:56,711 INFO L87 Difference]: Start difference. First operand 399 states and 571 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:15:56,810 INFO L93 Difference]: Finished difference Result 398 states and 570 transitions. [2021-12-07 01:15:56,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:15:56,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-07 01:15:56,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:15:56,812 INFO L225 Difference]: With dead ends: 398 [2021-12-07 01:15:56,812 INFO L226 Difference]: Without dead ends: 398 [2021-12-07 01:15:56,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:15:56,812 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 3 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:15:56,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 439 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:15:56,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-12-07 01:15:56,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2021-12-07 01:15:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 353 states have (on average 1.614730878186969) internal successors, (570), 397 states have internal predecessors, (570), 0 states have call successors, (0), 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-07 01:15:56,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 570 transitions. [2021-12-07 01:15:56,816 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 570 transitions. Word has length 34 [2021-12-07 01:15:56,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:15:56,816 INFO L470 AbstractCegarLoop]: Abstraction has 398 states and 570 transitions. [2021-12-07 01:15:56,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:15:56,817 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 570 transitions. [2021-12-07 01:15:56,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-07 01:15:56,817 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:15:56,817 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:15:56,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-07 01:15:56,817 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:15:56,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:15:56,817 INFO L85 PathProgramCache]: Analyzing trace with hash 191313679, now seen corresponding path program 1 times [2021-12-07 01:15:56,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:15:56,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321313797] [2021-12-07 01:15:56,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:56,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:15:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:15:56,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:15:56,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321313797] [2021-12-07 01:15:56,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321313797] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:15:56,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472021081] [2021-12-07 01:15:56,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:15:56,940 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:15:56,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:15:56,940 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:15:56,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-07 01:15:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:15:57,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-07 01:15:57,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:15:57,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-07 01:15:57,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-07 01:15:57,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-07 01:15:57,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:15:57,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-07 01:15:57,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:15:57,082 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-07 01:15:57,115 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:15:57,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:15:57,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:15:57,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:15:57,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:15:57,153 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-07 01:15:57,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:15:57,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:15:57,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:15:57,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-07 01:15:57,265 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:15:57,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2021-12-07 01:15:57,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-07 01:15:57,310 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:15:57,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:15:57,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2021-12-07 01:15:57,431 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2021-12-07 01:15:57,544 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:15:57,544 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2021-12-07 01:15:57,549 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-07 01:15:57,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2021-12-07 01:15:57,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:15:57,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:15:57,929 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1487) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= .cse0 0) (forall ((v_ArrVal_1488 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1488) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-07 01:15:57,943 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1487) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (and (= .cse0 0) (forall ((v_ArrVal_1488 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1488) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)))))) is different from false [2021-12-07 01:15:57,983 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1486))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (and (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1485 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1485) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1488) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse0 0))))) is different from false [2021-12-07 01:15:57,993 INFO L354 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2021-12-07 01:15:57,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2021-12-07 01:15:58,009 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1486))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse0 |c_ULTIMATE.start_main_#t~mem9#1.base|) (and (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1485 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1485) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1488) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse0 0))))) is different from false [2021-12-07 01:15:58,027 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int))) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1486))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1)) (and (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1485 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1485) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1488) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse0 0)))))) is different from false [2021-12-07 01:15:58,614 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-07 01:15:58,615 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-07 01:15:58,670 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_28| Int) (v_ArrVal_1484 (Array Int Int))) (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1484))) (let ((.cse0 (select (select (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |v_ULTIMATE.start_main_~tmpList~0#1.base_28| |c_ULTIMATE.start_main_~tree~0#1.base|) (and (= 0 .cse0) (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1485 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= (select (select (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc4#1.offset|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1483) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1485) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1484) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1488)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) .cse0)))))) is different from false [2021-12-07 01:15:59,254 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_28| Int) (v_ArrVal_1484 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_12| Int)) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4) 0) .cse2 |v_ULTIMATE.start_main_#t~malloc4#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1484))) (let ((.cse0 (select (select (let ((.cse5 (store .cse1 |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_28| |c_ULTIMATE.start_main_~tree~0#1.base|) (and (= .cse0 0) (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1485 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 0) .cse4 0)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1483) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1485) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 0) .cse4 |v_ULTIMATE.start_main_#t~malloc4#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1484) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1488)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) 0))))))) is different from false [2021-12-07 01:15:59,278 INFO L354 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2021-12-07 01:15:59,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 221 treesize of output 141 [2021-12-07 01:15:59,294 INFO L354 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2021-12-07 01:15:59,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 151 [2021-12-07 01:15:59,297 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:15:59,303 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-07 01:15:59,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 591 treesize of output 461 [2021-12-07 01:15:59,308 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:15:59,313 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-07 01:15:59,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 545 treesize of output 521 [2021-12-07 01:15:59,338 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 01:15:59,339 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 521 treesize of output 435 [2021-12-07 01:15:59,345 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 435 treesize of output 423 [2021-12-07 01:15:59,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2021-12-07 01:15:59,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2021-12-07 01:15:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:15:59,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472021081] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:15:59,408 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:15:59,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 20] total 45 [2021-12-07 01:15:59,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456659330] [2021-12-07 01:15:59,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:15:59,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-07 01:15:59,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:15:59,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-07 01:15:59,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1227, Unknown=22, NotChecked=546, Total=1980 [2021-12-07 01:15:59,410 INFO L87 Difference]: Start difference. First operand 398 states and 570 transitions. Second operand has 45 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 45 states have internal predecessors, (97), 0 states have call successors, (0), 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-07 01:15:59,460 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|))) (and (= |c_ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select .cse0 .cse1) 0) (= |c_ULTIMATE.start_main_#t~malloc4#1.offset| 0) (= (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (= (select .cse2 .cse1) 0) (= (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|)) (forall ((v_ArrVal_1487 (Array Int Int)) (v_ArrVal_1486 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_28| Int) (v_ArrVal_1484 (Array Int Int))) (let ((.cse6 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1484))) (let ((.cse3 (select (select (let ((.cse7 (store .cse5 |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) v_ArrVal_1487)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |v_ULTIMATE.start_main_~tmpList~0#1.base_28| |c_ULTIMATE.start_main_~tree~0#1.base|) (and (= 0 .cse3) (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1485 (Array Int Int)) (v_ArrVal_1483 (Array Int Int))) (= (select (select (let ((.cse4 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.offset|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1483) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1485) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1484) |v_ULTIMATE.start_main_~tmpList~0#1.base_28| v_ArrVal_1486) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1488)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse6) .cse3)))))))) is different from false [2021-12-07 01:16:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:01,167 INFO L93 Difference]: Finished difference Result 665 states and 873 transitions. [2021-12-07 01:16:01,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-07 01:16:01,168 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 45 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-07 01:16:01,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:01,170 INFO L225 Difference]: With dead ends: 665 [2021-12-07 01:16:01,170 INFO L226 Difference]: Without dead ends: 665 [2021-12-07 01:16:01,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=557, Invalid=3234, Unknown=23, NotChecked=1016, Total=4830 [2021-12-07 01:16:01,172 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 1075 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 2288 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 2038 SdHoareTripleChecker+Invalid, 5801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3417 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:01,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1075 Valid, 2038 Invalid, 5801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2288 Invalid, 0 Unknown, 3417 Unchecked, 0.9s Time] [2021-12-07 01:16:01,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2021-12-07 01:16:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 495. [2021-12-07 01:16:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 450 states have (on average 1.6022222222222222) internal successors, (721), 494 states have internal predecessors, (721), 0 states have call successors, (0), 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-07 01:16:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 721 transitions. [2021-12-07 01:16:01,178 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 721 transitions. Word has length 35 [2021-12-07 01:16:01,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:01,178 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 721 transitions. [2021-12-07 01:16:01,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.1555555555555554) internal successors, (97), 45 states have internal predecessors, (97), 0 states have call successors, (0), 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-07 01:16:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 721 transitions. [2021-12-07 01:16:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-07 01:16:01,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:01,179 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:16:01,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-07 01:16:01,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:01,380 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:16:01,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:01,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1262484393, now seen corresponding path program 1 times [2021-12-07 01:16:01,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:01,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601856027] [2021-12-07 01:16:01,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:01,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:01,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:16:01,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:16:01,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601856027] [2021-12-07 01:16:01,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601856027] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:16:01,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237520335] [2021-12-07 01:16:01,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:01,533 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:01,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:16:01,534 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:16:01,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-07 01:16:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:01,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-07 01:16:01,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:16:01,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-07 01:16:01,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-07 01:16:01,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-07 01:16:01,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:16:01,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-07 01:16:01,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:16:01,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-07 01:16:01,690 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:16:01,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:16:01,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:16:01,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:16:01,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:16:01,727 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-07 01:16:01,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:16:01,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:16:01,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:16:01,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2021-12-07 01:16:01,825 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:16:01,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2021-12-07 01:16:01,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-12-07 01:16:01,859 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:16:01,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:16:01,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2021-12-07 01:16:01,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2021-12-07 01:16:02,041 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:16:02,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2021-12-07 01:16:02,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2021-12-07 01:16:02,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-12-07 01:16:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:16:02,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:16:02,370 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1591 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1591) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (and (forall ((v_ArrVal_1590 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1590) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse0 0))))) is different from false [2021-12-07 01:16:02,382 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1591 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1591) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= (select |c_#valid| .cse0) 1) (and (forall ((v_ArrVal_1590 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1590) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse0 0))))) is different from false [2021-12-07 01:16:02,413 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1589))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1591)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= 0 .cse0) (forall ((v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1588) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1590) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-07 01:16:02,422 INFO L354 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2021-12-07 01:16:02,422 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2021-12-07 01:16:02,436 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1589))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1591)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= |c_ULTIMATE.start_main_#t~mem9#1.base| .cse0) (and (= 0 .cse0) (forall ((v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1588) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1590) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)))))) is different from false [2021-12-07 01:16:02,454 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1589))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1591)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= 0 .cse0) (forall ((v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1588) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1589) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1590) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) .cse0))))) is different from false [2021-12-07 01:16:02,995 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-07 01:16:02,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-07 01:16:03,077 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_30| Int) (v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1587 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1587))) (let ((.cse0 (select (select (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1589))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1591)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= .cse0 0) (forall ((v_ArrVal_1582 Int) (v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select (select (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1 v_ArrVal_1582)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1586) |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1588) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1587) |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1589) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_1590)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_30| |c_ULTIMATE.start_main_~tree~0#1.base|) (= (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) .cse0)))))) is different from false [2021-12-07 01:16:03,924 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_30| Int) (v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1587 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_15| Int) (v_ArrVal_1591 (Array Int Int))) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4) 0) .cse2 |v_ULTIMATE.start_main_#t~malloc4#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc4#1.base_15| v_ArrVal_1587))) (let ((.cse0 (select (select (let ((.cse5 (store .cse1 |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1589))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2) v_ArrVal_1591)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (= .cse0 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse2)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15|) 0)) (and (forall ((v_ArrVal_1582 Int) (v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select (select (let ((.cse3 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 0) .cse4 v_ArrVal_1582)) |v_ULTIMATE.start_main_#t~malloc4#1.base_15| v_ArrVal_1586) |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1588) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 0) .cse4 |v_ULTIMATE.start_main_#t~malloc4#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc4#1.base_15| v_ArrVal_1587) |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1589) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse4) v_ArrVal_1590)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0)) (= .cse0 0)) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_30| |c_ULTIMATE.start_main_~tree~0#1.base|)))))) is different from false [2021-12-07 01:16:03,948 INFO L354 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2021-12-07 01:16:03,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 221 treesize of output 141 [2021-12-07 01:16:03,964 INFO L354 Elim1Store]: treesize reduction 74, result has 28.2 percent of original size [2021-12-07 01:16:03,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 151 [2021-12-07 01:16:03,966 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:03,971 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-07 01:16:03,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 499 treesize of output 393 [2021-12-07 01:16:03,978 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:03,990 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-07 01:16:03,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 547 treesize of output 519 [2021-12-07 01:16:04,009 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 01:16:04,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 519 treesize of output 441 [2021-12-07 01:16:04,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 441 treesize of output 429 [2021-12-07 01:16:04,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 112 [2021-12-07 01:16:04,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 108 [2021-12-07 01:16:04,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:16:04,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237520335] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:16:04,099 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:16:04,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16, 20] total 45 [2021-12-07 01:16:04,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622671695] [2021-12-07 01:16:04,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:16:04,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-07 01:16:04,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:16:04,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-07 01:16:04,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1227, Unknown=22, NotChecked=546, Total=1980 [2021-12-07 01:16:04,101 INFO L87 Difference]: Start difference. First operand 495 states and 721 transitions. Second operand has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 45 states have internal predecessors, (96), 0 states have call successors, (0), 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-07 01:16:04,150 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 4)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|))) (and (= |c_ULTIMATE.start_main_~tree~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~tree~0#1.base|) 1) (= (select .cse0 .cse1) 0) (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_30| Int) (v_ArrVal_1589 (Array Int Int)) (v_ArrVal_1587 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (let ((.cse5 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1587))) (let ((.cse2 (select (select (let ((.cse6 (store .cse4 |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1589))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) v_ArrVal_1591)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|))) (or (and (= .cse2 0) (forall ((v_ArrVal_1582 Int) (v_ArrVal_1588 (Array Int Int)) (v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1590 (Array Int Int))) (= (select (select (let ((.cse3 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 v_ArrVal_1582)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1586) |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1588) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1587) |v_ULTIMATE.start_main_~tmpList~0#1.base_30| v_ArrVal_1589) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse3) v_ArrVal_1590)) |c_ULTIMATE.start_main_~tree~0#1.base|) |c_ULTIMATE.start_main_~tree~0#1.offset|) 0))) (= |v_ULTIMATE.start_main_~tmpList~0#1.base_30| |c_ULTIMATE.start_main_~tree~0#1.base|) (= (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5) .cse2)))))) (= (select .cse7 |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (= (select .cse7 .cse1) 0) (= (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_#t~malloc4#1.base| |c_ULTIMATE.start_main_~tree~0#1.base|)))) is different from false [2021-12-07 01:16:05,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:05,629 INFO L93 Difference]: Finished difference Result 876 states and 1186 transitions. [2021-12-07 01:16:05,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-07 01:16:05,629 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 45 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-07 01:16:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:05,632 INFO L225 Difference]: With dead ends: 876 [2021-12-07 01:16:05,632 INFO L226 Difference]: Without dead ends: 876 [2021-12-07 01:16:05,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=651, Invalid=3018, Unknown=23, NotChecked=1000, Total=4692 [2021-12-07 01:16:05,634 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 1656 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 2043 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 5258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 2043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3055 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:05,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1656 Valid, 1996 Invalid, 5258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 2043 Invalid, 0 Unknown, 3055 Unchecked, 0.8s Time] [2021-12-07 01:16:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2021-12-07 01:16:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 484. [2021-12-07 01:16:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 439 states have (on average 1.5899772209567198) internal successors, (698), 483 states have internal predecessors, (698), 0 states have call successors, (0), 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-07 01:16:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 698 transitions. [2021-12-07 01:16:05,640 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 698 transitions. Word has length 35 [2021-12-07 01:16:05,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:05,640 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 698 transitions. [2021-12-07 01:16:05,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 45 states have internal predecessors, (96), 0 states have call successors, (0), 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-07 01:16:05,641 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 698 transitions. [2021-12-07 01:16:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-07 01:16:05,641 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:05,641 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:16:05,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-07 01:16:05,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:05,843 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:16:05,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:05,844 INFO L85 PathProgramCache]: Analyzing trace with hash -974847376, now seen corresponding path program 1 times [2021-12-07 01:16:05,844 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:05,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582075968] [2021-12-07 01:16:05,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:05,845 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:06,030 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-07 01:16:06,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:16:06,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582075968] [2021-12-07 01:16:06,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582075968] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:16:06,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:16:06,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-07 01:16:06,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889371280] [2021-12-07 01:16:06,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:16:06,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-07 01:16:06,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:16:06,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-07 01:16:06,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-12-07 01:16:06,031 INFO L87 Difference]: Start difference. First operand 484 states and 698 transitions. Second operand has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:16:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:06,955 INFO L93 Difference]: Finished difference Result 827 states and 1106 transitions. [2021-12-07 01:16:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-07 01:16:06,955 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-07 01:16:06,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:06,958 INFO L225 Difference]: With dead ends: 827 [2021-12-07 01:16:06,958 INFO L226 Difference]: Without dead ends: 827 [2021-12-07 01:16:06,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2021-12-07 01:16:06,959 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 806 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:06,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [806 Valid, 875 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-07 01:16:06,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2021-12-07 01:16:06,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 517. [2021-12-07 01:16:06,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 472 states have (on average 1.5847457627118644) internal successors, (748), 516 states have internal predecessors, (748), 0 states have call successors, (0), 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-07 01:16:06,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 748 transitions. [2021-12-07 01:16:06,965 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 748 transitions. Word has length 35 [2021-12-07 01:16:06,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:06,966 INFO L470 AbstractCegarLoop]: Abstraction has 517 states and 748 transitions. [2021-12-07 01:16:06,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:16:06,966 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 748 transitions. [2021-12-07 01:16:06,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 01:16:06,966 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:06,966 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:16:06,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-12-07 01:16:06,966 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:16:06,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:06,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1222038395, now seen corresponding path program 1 times [2021-12-07 01:16:06,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:06,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733636123] [2021-12-07 01:16:06,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:06,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:16:07,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:16:07,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733636123] [2021-12-07 01:16:07,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733636123] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:16:07,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095269027] [2021-12-07 01:16:07,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:07,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:07,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:16:07,107 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:16:07,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-07 01:16:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:07,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-07 01:16:07,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:16:07,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-07 01:16:07,230 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:16:07,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:16:07,244 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:16:07,292 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:16:07,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-07 01:16:07,309 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:16:07,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:16:07,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2021-12-07 01:16:07,415 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:16:07,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-07 01:16:07,569 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:07,570 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:16:07,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2021-12-07 01:16:07,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:16:07,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:16:08,781 INFO L354 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2021-12-07 01:16:08,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2021-12-07 01:16:08,789 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.offset_59| Int) (v_ArrVal_1710 (Array Int Int)) (v_ArrVal_1709 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~tree~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.offset_59|) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1709))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1710)) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_59| 8))) (< |v_ULTIMATE.start_main_~tmp~0#1.offset_59| 0))) is different from false [2021-12-07 01:16:08,805 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.offset_59| Int) (v_ArrVal_1710 (Array Int Int)) (v_ArrVal_1709 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~tree~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.offset_59|) (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_1709))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_1710)) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_59| 8)))) (< |v_ULTIMATE.start_main_~tmp~0#1.offset_59| 0))) is different from false [2021-12-07 01:16:09,073 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:16:09,073 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 50 [2021-12-07 01:16:09,075 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:09,080 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:16:09,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 498 treesize of output 396 [2021-12-07 01:16:09,087 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 326 treesize of output 294 [2021-12-07 01:16:09,095 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:16:09,095 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 294 treesize of output 234 [2021-12-07 01:16:09,104 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-07 01:16:09,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-07 01:16:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:16:11,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095269027] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:16:11,339 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:16:11,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 34 [2021-12-07 01:16:11,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558405797] [2021-12-07 01:16:11,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:16:11,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-07 01:16:11,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:16:11,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-07 01:16:11,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=923, Unknown=31, NotChecked=126, Total=1190 [2021-12-07 01:16:11,341 INFO L87 Difference]: Start difference. First operand 517 states and 748 transitions. Second operand has 35 states, 34 states have (on average 2.823529411764706) internal successors, (96), 35 states have internal predecessors, (96), 0 states have call successors, (0), 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-07 01:16:12,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:12,126 INFO L93 Difference]: Finished difference Result 545 states and 780 transitions. [2021-12-07 01:16:12,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-07 01:16:12,126 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.823529411764706) internal successors, (96), 35 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-07 01:16:12,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:12,128 INFO L225 Difference]: With dead ends: 545 [2021-12-07 01:16:12,128 INFO L226 Difference]: Without dead ends: 545 [2021-12-07 01:16:12,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=407, Invalid=2015, Unknown=36, NotChecked=194, Total=2652 [2021-12-07 01:16:12,129 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 318 mSDsluCounter, 2229 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 2368 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 964 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:12,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 2368 Invalid, 2100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1083 Invalid, 0 Unknown, 964 Unchecked, 0.4s Time] [2021-12-07 01:16:12,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-12-07 01:16:12,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 528. [2021-12-07 01:16:12,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 483 states have (on average 1.5776397515527951) internal successors, (762), 527 states have internal predecessors, (762), 0 states have call successors, (0), 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-07 01:16:12,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 762 transitions. [2021-12-07 01:16:12,134 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 762 transitions. Word has length 36 [2021-12-07 01:16:12,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:12,135 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 762 transitions. [2021-12-07 01:16:12,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.823529411764706) internal successors, (96), 35 states have internal predecessors, (96), 0 states have call successors, (0), 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-07 01:16:12,135 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 762 transitions. [2021-12-07 01:16:12,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 01:16:12,135 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:12,135 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:16:12,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-07 01:16:12,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-12-07 01:16:12,337 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:16:12,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:12,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1222038396, now seen corresponding path program 1 times [2021-12-07 01:16:12,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:12,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548012073] [2021-12-07 01:16:12,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:12,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:16:12,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:16:12,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548012073] [2021-12-07 01:16:12,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548012073] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:16:12,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524772893] [2021-12-07 01:16:12,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:12,571 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:12,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:16:12,571 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:16:12,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-07 01:16:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:12,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-07 01:16:12,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:16:12,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-07 01:16:12,686 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:16:12,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:16:12,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:16:12,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:16:12,765 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:16:12,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-07 01:16:12,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-07 01:16:12,788 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:16:12,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:16:12,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-07 01:16:12,860 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2021-12-07 01:16:12,923 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:16:12,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-07 01:16:12,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-07 01:16:13,108 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:13,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2021-12-07 01:16:13,112 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:13,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-07 01:16:13,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:16:13,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:16:14,753 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:16:14,753 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 84 [2021-12-07 01:16:18,602 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:16:18,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 161 [2021-12-07 01:16:18,608 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:16:18,609 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 121 [2021-12-07 01:16:18,611 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:18,619 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:16:18,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 488 treesize of output 398 [2021-12-07 01:16:18,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:18,634 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:16:18,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 734 treesize of output 704 [2021-12-07 01:16:18,653 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-07 01:16:18,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-07 01:16:18,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 603 treesize of output 587 [2021-12-07 01:16:18,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 587 treesize of output 571 [2021-12-07 01:16:18,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 571 treesize of output 539 [2021-12-07 01:16:18,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 539 treesize of output 523 [2021-12-07 01:16:18,698 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 523 treesize of output 515 [2021-12-07 01:16:18,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 515 treesize of output 499 [2021-12-07 01:16:18,715 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:16:18,716 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 499 treesize of output 456 [2021-12-07 01:16:18,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 443 treesize of output 419 [2021-12-07 01:16:23,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:16:23,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524772893] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:16:23,176 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:16:23,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 15] total 39 [2021-12-07 01:16:23,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132546733] [2021-12-07 01:16:23,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:16:23,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-07 01:16:23,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:16:23,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-07 01:16:23,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1382, Unknown=45, NotChecked=0, Total=1560 [2021-12-07 01:16:23,177 INFO L87 Difference]: Start difference. First operand 528 states and 762 transitions. Second operand has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 40 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-07 01:16:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:24,812 INFO L93 Difference]: Finished difference Result 617 states and 870 transitions. [2021-12-07 01:16:24,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-07 01:16:24,812 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 40 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-07 01:16:24,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:24,814 INFO L225 Difference]: With dead ends: 617 [2021-12-07 01:16:24,815 INFO L226 Difference]: Without dead ends: 617 [2021-12-07 01:16:24,815 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=462, Invalid=2799, Unknown=45, NotChecked=0, Total=3306 [2021-12-07 01:16:24,816 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 550 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 2631 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 870 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:24,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [550 Valid, 2631 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1347 Invalid, 0 Unknown, 870 Unchecked, 0.8s Time] [2021-12-07 01:16:24,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2021-12-07 01:16:24,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 528. [2021-12-07 01:16:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 483 states have (on average 1.5755693581780539) internal successors, (761), 527 states have internal predecessors, (761), 0 states have call successors, (0), 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-07 01:16:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 761 transitions. [2021-12-07 01:16:24,822 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 761 transitions. Word has length 36 [2021-12-07 01:16:24,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:24,822 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 761 transitions. [2021-12-07 01:16:24,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.717948717948718) internal successors, (106), 40 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-07 01:16:24,822 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 761 transitions. [2021-12-07 01:16:24,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-07 01:16:24,822 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:24,822 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:16:24,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-07 01:16:25,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:25,024 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:16:25,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:25,025 INFO L85 PathProgramCache]: Analyzing trace with hash -751292082, now seen corresponding path program 1 times [2021-12-07 01:16:25,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:25,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739041625] [2021-12-07 01:16:25,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:25,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:16:25,225 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:16:25,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739041625] [2021-12-07 01:16:25,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739041625] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:16:25,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387875432] [2021-12-07 01:16:25,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:25,225 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:25,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:16:25,226 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:16:25,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-07 01:16:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:25,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-07 01:16:25,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:16:25,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-07 01:16:25,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:16:25,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:16:25,389 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:16:25,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:16:25,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:16:25,426 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-07 01:16:25,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:16:25,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-12-07 01:16:25,539 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:16:25,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2021-12-07 01:16:25,542 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-07 01:16:25,588 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:16:25,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:16:25,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-07 01:16:25,650 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2021-12-07 01:16:25,730 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:16:25,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2021-12-07 01:16:25,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-07 01:16:25,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:16:25,885 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:25,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2021-12-07 01:16:25,889 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:25,891 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:16:25,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2021-12-07 01:16:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:16:25,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:16:29,646 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-07 01:16:29,647 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-07 01:16:42,455 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:42,462 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:16:42,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 127 [2021-12-07 01:16:42,466 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:42,473 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:16:42,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 102 [2021-12-07 01:16:42,477 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:42,480 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:42,480 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:42,488 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:16:42,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 366 treesize of output 312 [2021-12-07 01:16:42,496 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:42,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:42,498 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:42,506 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:16:42,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 474 treesize of output 456 [2021-12-07 01:16:42,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 365 treesize of output 349 [2021-12-07 01:16:42,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 349 treesize of output 325 [2021-12-07 01:16:42,539 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 325 treesize of output 313 [2021-12-07 01:16:42,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 313 treesize of output 297 [2021-12-07 01:16:42,552 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:16:42,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 265 [2021-12-07 01:16:48,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:16:48,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387875432] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:16:48,785 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:16:48,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 16] total 34 [2021-12-07 01:16:48,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933442496] [2021-12-07 01:16:48,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:16:48,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-07 01:16:48,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:16:48,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-07 01:16:48,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=948, Unknown=36, NotChecked=0, Total=1122 [2021-12-07 01:16:48,787 INFO L87 Difference]: Start difference. First operand 528 states and 761 transitions. Second operand has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 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-07 01:16:49,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:49,612 INFO L93 Difference]: Finished difference Result 506 states and 708 transitions. [2021-12-07 01:16:49,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-07 01:16:49,612 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 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-07 01:16:49,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:49,614 INFO L225 Difference]: With dead ends: 506 [2021-12-07 01:16:49,614 INFO L226 Difference]: Without dead ends: 506 [2021-12-07 01:16:49,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=362, Invalid=1764, Unknown=36, NotChecked=0, Total=2162 [2021-12-07 01:16:49,615 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 410 mSDsluCounter, 2107 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 2250 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 826 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:49,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [410 Valid, 2250 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 787 Invalid, 0 Unknown, 826 Unchecked, 0.4s Time] [2021-12-07 01:16:49,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2021-12-07 01:16:49,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 484. [2021-12-07 01:16:49,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 439 states have (on average 1.5580865603644647) internal successors, (684), 483 states have internal predecessors, (684), 0 states have call successors, (0), 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-07 01:16:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 684 transitions. [2021-12-07 01:16:49,620 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 684 transitions. Word has length 37 [2021-12-07 01:16:49,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:49,620 INFO L470 AbstractCegarLoop]: Abstraction has 484 states and 684 transitions. [2021-12-07 01:16:49,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 34 states have internal predecessors, (92), 0 states have call successors, (0), 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-07 01:16:49,620 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 684 transitions. [2021-12-07 01:16:49,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-07 01:16:49,621 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:49,621 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:16:49,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-07 01:16:49,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:49,822 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:16:49,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:49,824 INFO L85 PathProgramCache]: Analyzing trace with hash -525450377, now seen corresponding path program 1 times [2021-12-07 01:16:49,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:49,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077617670] [2021-12-07 01:16:49,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:49,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:16:49,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:16:49,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077617670] [2021-12-07 01:16:49,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077617670] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:16:49,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:16:49,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:16:49,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396551835] [2021-12-07 01:16:49,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:16:49,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:16:49,888 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:16:49,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:16:49,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:16:49,888 INFO L87 Difference]: Start difference. First operand 484 states and 684 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:16:49,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:16:49,909 INFO L93 Difference]: Finished difference Result 476 states and 633 transitions. [2021-12-07 01:16:49,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:16:49,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-12-07 01:16:49,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:16:49,911 INFO L225 Difference]: With dead ends: 476 [2021-12-07 01:16:49,911 INFO L226 Difference]: Without dead ends: 476 [2021-12-07 01:16:49,911 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-07 01:16:49,911 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 33 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:16:49,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 313 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:16:49,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2021-12-07 01:16:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 457. [2021-12-07 01:16:49,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 412 states have (on average 1.5364077669902914) internal successors, (633), 456 states have internal predecessors, (633), 0 states have call successors, (0), 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-07 01:16:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 633 transitions. [2021-12-07 01:16:49,916 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 633 transitions. Word has length 37 [2021-12-07 01:16:49,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:16:49,916 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 633 transitions. [2021-12-07 01:16:49,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:16:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 633 transitions. [2021-12-07 01:16:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-07 01:16:49,917 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:16:49,917 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:16:49,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-12-07 01:16:49,917 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:16:49,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:16:49,917 INFO L85 PathProgramCache]: Analyzing trace with hash 890909625, now seen corresponding path program 1 times [2021-12-07 01:16:49,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:16:49,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706430845] [2021-12-07 01:16:49,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:49,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:16:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:50,472 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-07 01:16:50,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:16:50,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706430845] [2021-12-07 01:16:50,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706430845] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:16:50,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501881369] [2021-12-07 01:16:50,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:16:50,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:16:50,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:16:50,473 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:16:50,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-07 01:16:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:16:50,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-07 01:16:50,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:16:50,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:16:50,779 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:16:50,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-07 01:16:51,019 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:16:51,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2021-12-07 01:16:51,384 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-07 01:16:51,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:16:52,090 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~tmp~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_main_~tmp~0#1.offset|) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~tree~0#1.base|) 0) (forall ((v_ArrVal_1999 (Array Int Int))) (= (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_1999) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |ULTIMATE.start_main_~tmp~0#1.offset| 8)) 0) |c_ULTIMATE.start_main_~tree~0#1.base| (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~tree~0#1.base|)) |c_ULTIMATE.start_main_old_#valid#1|))) (< |ULTIMATE.start_main_~tmp~0#1.offset| 0))) is different from false [2021-12-07 01:16:52,126 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:16:52,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2021-12-07 01:16:52,134 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:16:52,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2021-12-07 01:16:52,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2021-12-07 01:18:05,005 WARN L227 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 01:18:07,819 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-07 01:18:07,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501881369] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:18:07,820 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:18:07,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 38 [2021-12-07 01:18:07,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111156031] [2021-12-07 01:18:07,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:18:07,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-07 01:18:07,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:18:07,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-07 01:18:07,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1242, Unknown=46, NotChecked=72, Total=1482 [2021-12-07 01:18:07,821 INFO L87 Difference]: Start difference. First operand 457 states and 633 transitions. Second operand has 39 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 39 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-07 01:18:37,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:18:37,925 INFO L93 Difference]: Finished difference Result 481 states and 657 transitions. [2021-12-07 01:18:37,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-07 01:18:37,925 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 39 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) Word has length 38 [2021-12-07 01:18:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:18:37,927 INFO L225 Difference]: With dead ends: 481 [2021-12-07 01:18:37,927 INFO L226 Difference]: Without dead ends: 459 [2021-12-07 01:18:37,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 103.0s TimeCoverageRelationStatistics Valid=235, Invalid=2363, Unknown=58, NotChecked=100, Total=2756 [2021-12-07 01:18:37,928 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 21 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 668 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-07 01:18:37,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 1677 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 768 Invalid, 0 Unknown, 668 Unchecked, 0.7s Time] [2021-12-07 01:18:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2021-12-07 01:18:37,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2021-12-07 01:18:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 414 states have (on average 1.5338164251207729) internal successors, (635), 458 states have internal predecessors, (635), 0 states have call successors, (0), 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-07 01:18:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 635 transitions. [2021-12-07 01:18:37,933 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 635 transitions. Word has length 38 [2021-12-07 01:18:37,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:18:37,933 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 635 transitions. [2021-12-07 01:18:37,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 39 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-07 01:18:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 635 transitions. [2021-12-07 01:18:37,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-07 01:18:37,934 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:18:37,934 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:18:37,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-12-07 01:18:38,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2021-12-07 01:18:38,136 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:18:38,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:18:38,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1603274722, now seen corresponding path program 1 times [2021-12-07 01:18:38,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:18:38,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606091294] [2021-12-07 01:18:38,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:18:38,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:18:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:18:38,401 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:18:38,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606091294] [2021-12-07 01:18:38,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606091294] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:18:38,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790060] [2021-12-07 01:18:38,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:18:38,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:18:38,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:18:38,402 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:18:38,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-07 01:18:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:38,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-07 01:18:38,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:18:38,509 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-07 01:18:38,545 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:18:38,546 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:18:38,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:18:38,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:18:38,683 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:18:38,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-07 01:18:38,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-07 01:18:38,719 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:18:38,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:18:38,771 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-07 01:18:38,774 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-07 01:18:38,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-07 01:18:38,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-07 01:18:39,052 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:18:39,054 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:18:39,055 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2021-12-07 01:18:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:18:39,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:18:39,204 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2095 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.offset_68| Int)) (or (< |c_ULTIMATE.start_main_~tree~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.offset_68|) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2095) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_68| 8)) 0) (< |v_ULTIMATE.start_main_~tmp~0#1.offset_68| 0))) is different from false [2021-12-07 01:18:39,223 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2095 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.offset_68| Int)) (or (< |c_ULTIMATE.start_main_~tree~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.offset_68|) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_2095) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_68| 8)) 0) (< |v_ULTIMATE.start_main_~tmp~0#1.offset_68| 0))) is different from false [2021-12-07 01:18:39,259 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2093 (Array Int Int)) (v_ArrVal_2095 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.offset_68| Int)) (or (< |c_ULTIMATE.start_main_~tree~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.offset_68|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2093) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2094) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_2095) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_68| 8)) 0) (< |v_ULTIMATE.start_main_~tmp~0#1.offset_68| 0))) is different from false [2021-12-07 01:18:39,517 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2093 (Array Int Int)) (v_ArrVal_2092 (Array Int Int)) (v_ArrVal_2091 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_39| Int) (v_ArrVal_2095 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.offset_68| Int)) (or (< |c_ULTIMATE.start_main_~tree~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.offset_68|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_39|) 0)) (< |v_ULTIMATE.start_main_~tmp~0#1.offset_68| 0) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2091) |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_2093) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2092) |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_2094) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_2095) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_68| 8)) 0))) is different from false [2021-12-07 01:18:39,609 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2094 (Array Int Int)) (v_ArrVal_2093 (Array Int Int)) (v_ArrVal_2092 (Array Int Int)) (v_ArrVal_2091 (Array Int Int)) (|v_ULTIMATE.start_main_~tmpList~0#1.base_39| Int) (v_ArrVal_2095 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.offset_68| Int)) (or (< |c_ULTIMATE.start_main_~tree~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.offset_68|) (= (select (select (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2091) |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_2093) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2092) |v_ULTIMATE.start_main_~tmpList~0#1.base_39| v_ArrVal_2094) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_2095))) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_68| 8)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_39|) 0)) (< |v_ULTIMATE.start_main_~tmp~0#1.offset_68| 0))) is different from false [2021-12-07 01:18:39,664 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:18:39,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2021-12-07 01:18:39,673 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:18:39,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2021-12-07 01:18:39,676 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:18:39,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2021-12-07 01:18:39,680 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:18:39,688 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:18:39,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 214 [2021-12-07 01:18:39,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 58 [2021-12-07 01:18:39,702 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 158 [2021-12-07 01:18:39,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 146 [2021-12-07 01:18:39,720 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-07 01:18:39,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-07 01:18:41,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:18:41,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790060] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:18:41,969 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:18:41,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 13] total 35 [2021-12-07 01:18:41,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471425072] [2021-12-07 01:18:41,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:18:41,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-12-07 01:18:41,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:18:41,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-12-07 01:18:41,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=798, Unknown=6, NotChecked=310, Total=1260 [2021-12-07 01:18:41,971 INFO L87 Difference]: Start difference. First operand 459 states and 635 transitions. Second operand has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 36 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:18:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:18:43,080 INFO L93 Difference]: Finished difference Result 479 states and 657 transitions. [2021-12-07 01:18:43,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-07 01:18:43,080 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 36 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-07 01:18:43,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:18:43,082 INFO L225 Difference]: With dead ends: 479 [2021-12-07 01:18:43,082 INFO L226 Difference]: Without dead ends: 479 [2021-12-07 01:18:43,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=328, Invalid=1326, Unknown=6, NotChecked=410, Total=2070 [2021-12-07 01:18:43,083 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 495 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1883 SdHoareTripleChecker+Invalid, 2072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1134 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-07 01:18:43,083 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [495 Valid, 1883 Invalid, 2072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 835 Invalid, 0 Unknown, 1134 Unchecked, 0.6s Time] [2021-12-07 01:18:43,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-12-07 01:18:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 462. [2021-12-07 01:18:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 417 states have (on average 1.5323741007194245) internal successors, (639), 461 states have internal predecessors, (639), 0 states have call successors, (0), 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-07 01:18:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 639 transitions. [2021-12-07 01:18:43,088 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 639 transitions. Word has length 39 [2021-12-07 01:18:43,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:18:43,088 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 639 transitions. [2021-12-07 01:18:43,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.9714285714285715) internal successors, (104), 36 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:18:43,088 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 639 transitions. [2021-12-07 01:18:43,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-07 01:18:43,089 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:18:43,089 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:18:43,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-07 01:18:43,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:18:43,290 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:18:43,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:18:43,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1069717192, now seen corresponding path program 1 times [2021-12-07 01:18:43,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:18:43,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123929336] [2021-12-07 01:18:43,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:18:43,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:18:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:43,875 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-07 01:18:43,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:18:43,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123929336] [2021-12-07 01:18:43,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123929336] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:18:43,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:18:43,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-07 01:18:43,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764932142] [2021-12-07 01:18:43,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:18:43,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-07 01:18:43,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:18:43,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-07 01:18:43,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-12-07 01:18:43,876 INFO L87 Difference]: Start difference. First operand 462 states and 639 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:18:45,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:18:45,403 INFO L93 Difference]: Finished difference Result 700 states and 921 transitions. [2021-12-07 01:18:45,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-07 01:18:45,404 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-07 01:18:45,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:18:45,406 INFO L225 Difference]: With dead ends: 700 [2021-12-07 01:18:45,406 INFO L226 Difference]: Without dead ends: 700 [2021-12-07 01:18:45,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2021-12-07 01:18:45,406 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 791 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-07 01:18:45,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [791 Valid, 869 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-07 01:18:45,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2021-12-07 01:18:45,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 514. [2021-12-07 01:18:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 469 states have (on average 1.5266524520255864) internal successors, (716), 513 states have internal predecessors, (716), 0 states have call successors, (0), 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-07 01:18:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 716 transitions. [2021-12-07 01:18:45,412 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 716 transitions. Word has length 39 [2021-12-07 01:18:45,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:18:45,412 INFO L470 AbstractCegarLoop]: Abstraction has 514 states and 716 transitions. [2021-12-07 01:18:45,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:18:45,414 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 716 transitions. [2021-12-07 01:18:45,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-07 01:18:45,415 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:18:45,415 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:18:45,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-12-07 01:18:45,415 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:18:45,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:18:45,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1069717193, now seen corresponding path program 1 times [2021-12-07 01:18:45,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:18:45,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061766809] [2021-12-07 01:18:45,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:18:45,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:18:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:45,810 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-07 01:18:45,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:18:45,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061766809] [2021-12-07 01:18:45,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061766809] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:18:45,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:18:45,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-07 01:18:45,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707716326] [2021-12-07 01:18:45,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:18:45,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-07 01:18:45,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:18:45,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-07 01:18:45,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2021-12-07 01:18:45,811 INFO L87 Difference]: Start difference. First operand 514 states and 716 transitions. Second operand has 17 states, 16 states have (on average 2.4375) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:18:47,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:18:47,240 INFO L93 Difference]: Finished difference Result 805 states and 1068 transitions. [2021-12-07 01:18:47,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-07 01:18:47,240 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-12-07 01:18:47,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:18:47,243 INFO L225 Difference]: With dead ends: 805 [2021-12-07 01:18:47,243 INFO L226 Difference]: Without dead ends: 805 [2021-12-07 01:18:47,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=811, Unknown=0, NotChecked=0, Total=1056 [2021-12-07 01:18:47,244 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 1027 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-07 01:18:47,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1027 Valid, 1010 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-07 01:18:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2021-12-07 01:18:47,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 514. [2021-12-07 01:18:47,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 469 states have (on average 1.5245202558635393) internal successors, (715), 513 states have internal predecessors, (715), 0 states have call successors, (0), 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-07 01:18:47,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 715 transitions. [2021-12-07 01:18:47,253 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 715 transitions. Word has length 39 [2021-12-07 01:18:47,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:18:47,253 INFO L470 AbstractCegarLoop]: Abstraction has 514 states and 715 transitions. [2021-12-07 01:18:47,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.4375) internal successors, (39), 17 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:18:47,253 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 715 transitions. [2021-12-07 01:18:47,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-07 01:18:47,254 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:18:47,254 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:18:47,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-12-07 01:18:47,254 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr98ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:18:47,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:18:47,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1838090824, now seen corresponding path program 1 times [2021-12-07 01:18:47,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:18:47,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300817003] [2021-12-07 01:18:47,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:18:47,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:18:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:47,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:18:47,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:18:47,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300817003] [2021-12-07 01:18:47,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300817003] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:18:47,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837145704] [2021-12-07 01:18:47,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:18:47,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:18:47,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:18:47,617 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:18:47,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-07 01:18:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:47,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-07 01:18:47,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:18:47,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-07 01:18:47,761 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:18:47,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:18:47,802 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:18:47,919 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:18:47,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-07 01:18:47,950 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:18:47,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:18:48,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2021-12-07 01:18:48,102 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:18:48,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-07 01:18:48,373 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:18:48,376 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:18:48,376 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 14 [2021-12-07 01:18:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:18:48,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:18:48,608 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.offset_70| Int) (v_ArrVal_2313 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_2313) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_70| 8)) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_main_~tmp~0#1.offset_70| 0) (< |c_ULTIMATE.start_main_~tree~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.offset_70|))) is different from false [2021-12-07 01:18:48,623 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.offset_70| Int) (v_ArrVal_2313 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~tmp~0#1.offset_70| 0) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_2313) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_70| 8)) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~tree~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.offset_70|))) is different from false [2021-12-07 01:18:48,649 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmp~0#1.offset_70| Int) (v_ArrVal_2313 (Array Int Int)) (v_ArrVal_2312 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~tmp~0#1.offset_70| 0) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2312))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_2313)) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_70| 8)) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~tree~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.offset_70|))) is different from false [2021-12-07 01:18:48,892 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_41| Int) (|v_ULTIMATE.start_main_~tmp~0#1.offset_70| Int) (v_ArrVal_2313 (Array Int Int)) (v_ArrVal_2312 (Array Int Int)) (v_ArrVal_2311 (Array Int Int))) (or (< (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2311) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_ArrVal_2312))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|)) v_ArrVal_2313)) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_70| 8)) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_main_~tmp~0#1.offset_70| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_41|) 0)) (< |c_ULTIMATE.start_main_~tree~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.offset_70|))) is different from false [2021-12-07 01:18:48,965 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_41| Int) (|v_ULTIMATE.start_main_~tmp~0#1.offset_70| Int) (v_ArrVal_2313 (Array Int Int)) (v_ArrVal_2312 (Array Int Int)) (v_ArrVal_2311 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~tmp~0#1.offset_70| 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_41|) 0)) (< (select (select (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_2311) |v_ULTIMATE.start_main_~tmpList~0#1.base_41| v_ArrVal_2312))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse1) v_ArrVal_2313))) |c_ULTIMATE.start_main_~tree~0#1.base|) (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_70| 8)) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~tree~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.offset_70|))) is different from false [2021-12-07 01:18:49,016 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:18:49,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2021-12-07 01:18:49,019 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:18:49,027 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:18:49,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 138 [2021-12-07 01:18:49,040 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:18:49,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 78 [2021-12-07 01:18:49,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2021-12-07 01:18:49,056 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-07 01:18:49,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-07 01:18:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:18:51,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837145704] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:18:51,320 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:18:51,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 13] total 38 [2021-12-07 01:18:51,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070453476] [2021-12-07 01:18:51,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:18:51,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-07 01:18:51,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:18:51,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-07 01:18:51,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=963, Unknown=6, NotChecked=330, Total=1406 [2021-12-07 01:18:51,321 INFO L87 Difference]: Start difference. First operand 514 states and 715 transitions. Second operand has 38 states, 38 states have (on average 3.0526315789473686) internal successors, (116), 38 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:18:53,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:18:53,834 INFO L93 Difference]: Finished difference Result 526 states and 728 transitions. [2021-12-07 01:18:53,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-12-07 01:18:53,835 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.0526315789473686) internal successors, (116), 38 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-07 01:18:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:18:53,836 INFO L225 Difference]: With dead ends: 526 [2021-12-07 01:18:53,836 INFO L226 Difference]: Without dead ends: 524 [2021-12-07 01:18:53,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=394, Invalid=2590, Unknown=6, NotChecked=550, Total=3540 [2021-12-07 01:18:53,837 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 275 mSDsluCounter, 2660 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 2812 SdHoareTripleChecker+Invalid, 2322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 844 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:18:53,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 2812 Invalid, 2322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1446 Invalid, 0 Unknown, 844 Unchecked, 1.2s Time] [2021-12-07 01:18:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2021-12-07 01:18:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 512. [2021-12-07 01:18:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 467 states have (on average 1.5246252676659529) internal successors, (712), 511 states have internal predecessors, (712), 0 states have call successors, (0), 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-07 01:18:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 712 transitions. [2021-12-07 01:18:53,842 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 712 transitions. Word has length 40 [2021-12-07 01:18:53,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:18:53,842 INFO L470 AbstractCegarLoop]: Abstraction has 512 states and 712 transitions. [2021-12-07 01:18:53,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.0526315789473686) internal successors, (116), 38 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:18:53,842 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 712 transitions. [2021-12-07 01:18:53,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-07 01:18:53,843 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:18:53,843 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:18:53,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-07 01:18:54,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2021-12-07 01:18:54,044 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:18:54,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:18:54,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1495622602, now seen corresponding path program 1 times [2021-12-07 01:18:54,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:18:54,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114893701] [2021-12-07 01:18:54,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:18:54,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:18:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:18:54,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:18:54,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114893701] [2021-12-07 01:18:54,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114893701] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:18:54,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812667935] [2021-12-07 01:18:54,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:18:54,133 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:18:54,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:18:54,133 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:18:54,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-07 01:18:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:54,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-07 01:18:54,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:18:54,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:18:54,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-07 01:18:54,427 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:18:54,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:18:54,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:18:54,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-07 01:18:54,478 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:18:54,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:18:54,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:18:54,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:18:54,696 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-07 01:18:54,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-07 01:18:55,827 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:18:55,828 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2021-12-07 01:18:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:18:55,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812667935] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:18:55,839 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:18:55,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2021-12-07 01:18:55,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817467266] [2021-12-07 01:18:55,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:18:55,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-07 01:18:55,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:18:55,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-07 01:18:55,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2021-12-07 01:18:55,840 INFO L87 Difference]: Start difference. First operand 512 states and 712 transitions. Second operand has 18 states, 17 states have (on average 6.882352941176471) internal successors, (117), 18 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:18:56,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:18:56,812 INFO L93 Difference]: Finished difference Result 737 states and 918 transitions. [2021-12-07 01:18:56,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-07 01:18:56,812 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.882352941176471) internal successors, (117), 18 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-12-07 01:18:56,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:18:56,813 INFO L225 Difference]: With dead ends: 737 [2021-12-07 01:18:56,813 INFO L226 Difference]: Without dead ends: 737 [2021-12-07 01:18:56,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=656, Unknown=0, NotChecked=0, Total=870 [2021-12-07 01:18:56,814 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 1797 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1797 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 338 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-07 01:18:56,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1797 Valid, 736 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 780 Invalid, 0 Unknown, 338 Unchecked, 0.7s Time] [2021-12-07 01:18:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2021-12-07 01:18:56,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 566. [2021-12-07 01:18:56,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 529 states have (on average 1.4158790170132325) internal successors, (749), 565 states have internal predecessors, (749), 0 states have call successors, (0), 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-07 01:18:56,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 749 transitions. [2021-12-07 01:18:56,820 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 749 transitions. Word has length 41 [2021-12-07 01:18:56,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:18:56,820 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 749 transitions. [2021-12-07 01:18:56,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.882352941176471) internal successors, (117), 18 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:18:56,820 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 749 transitions. [2021-12-07 01:18:56,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-07 01:18:56,821 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:18:56,821 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:18:56,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-07 01:18:57,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2021-12-07 01:18:57,022 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:18:57,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:18:57,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1141295518, now seen corresponding path program 1 times [2021-12-07 01:18:57,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:18:57,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863483750] [2021-12-07 01:18:57,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:18:57,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:18:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:18:57,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:18:57,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863483750] [2021-12-07 01:18:57,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863483750] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:18:57,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609488645] [2021-12-07 01:18:57,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:18:57,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:18:57,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:18:57,451 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:18:57,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-07 01:18:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:57,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 51 conjunts are in the unsatisfiable core [2021-12-07 01:18:57,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:18:57,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-07 01:18:57,613 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:18:57,613 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:18:57,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:18:57,726 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:18:57,726 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2021-12-07 01:18:57,757 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-07 01:18:57,757 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-07 01:18:57,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-07 01:18:57,912 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-12-07 01:18:57,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 36 [2021-12-07 01:18:57,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 54 [2021-12-07 01:18:58,327 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:18:58,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 33 [2021-12-07 01:18:58,434 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:18:58,442 INFO L354 Elim1Store]: treesize reduction 34, result has 8.1 percent of original size [2021-12-07 01:18:58,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 26 [2021-12-07 01:18:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:18:58,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:18:58,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609488645] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:18:58,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:18:58,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 29 [2021-12-07 01:18:58,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217436455] [2021-12-07 01:18:58,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:18:58,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-07 01:18:58,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:18:58,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-07 01:18:58,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2021-12-07 01:18:58,549 INFO L87 Difference]: Start difference. First operand 566 states and 749 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 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-07 01:18:58,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:18:58,908 INFO L93 Difference]: Finished difference Result 575 states and 759 transitions. [2021-12-07 01:18:58,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-07 01:18:58,908 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 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-07 01:18:58,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:18:58,909 INFO L225 Difference]: With dead ends: 575 [2021-12-07 01:18:58,909 INFO L226 Difference]: Without dead ends: 575 [2021-12-07 01:18:58,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2021-12-07 01:18:58,909 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 149 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 365 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:18:58,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 786 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 257 Invalid, 0 Unknown, 365 Unchecked, 0.2s Time] [2021-12-07 01:18:58,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-12-07 01:18:58,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 571. [2021-12-07 01:18:58,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 534 states have (on average 1.4138576779026217) internal successors, (755), 570 states have internal predecessors, (755), 0 states have call successors, (0), 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-07 01:18:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 755 transitions. [2021-12-07 01:18:58,915 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 755 transitions. Word has length 42 [2021-12-07 01:18:58,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:18:58,915 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 755 transitions. [2021-12-07 01:18:58,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 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-07 01:18:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 755 transitions. [2021-12-07 01:18:58,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-07 01:18:58,915 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:18:58,916 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:18:58,935 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-07 01:18:59,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2021-12-07 01:18:59,117 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 100 more)] === [2021-12-07 01:18:59,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:18:59,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1141295517, now seen corresponding path program 1 times [2021-12-07 01:18:59,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:18:59,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349664901] [2021-12-07 01:18:59,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:18:59,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:18:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:18:59,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:18:59,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349664901] [2021-12-07 01:18:59,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349664901] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:18:59,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267773329] [2021-12-07 01:18:59,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:18:59,531 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:18:59,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:18:59,531 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:18:59,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44830551-07da-4b28-96df-46400e5c24b0/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-07 01:18:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:18:59,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 69 conjunts are in the unsatisfiable core [2021-12-07 01:18:59,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:18:59,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-07 01:18:59,685 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:18:59,685 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:18:59,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:18:59,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:18:59,824 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:18:59,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-07 01:18:59,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-07 01:18:59,859 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:18:59,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-07 01:18:59,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2021-12-07 01:18:59,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-07 01:19:00,088 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-12-07 01:19:00,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 47 [2021-12-07 01:19:00,092 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 58 [2021-12-07 01:19:00,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:19:00,862 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:19:00,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:19:00,870 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-07 01:19:00,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 46 [2021-12-07 01:19:00,876 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:19:00,881 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-07 01:19:00,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 16 [2021-12-07 01:19:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:19:00,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:19:10,467 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:19:10,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 436 treesize of output 440 [2021-12-07 01:19:10,739 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2625 (Array Int Int)) (v_ArrVal_2624 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.offset_75| Int)) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2624)) (.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_2625)) (.cse10 (+ 8 |c_ULTIMATE.start_main_~tree~0#1.offset|))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10)) (.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse10))) (let ((.cse4 (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 |c_ULTIMATE.start_main_~tmpList~0#1.offset|))) (.cse5 (+ |v_ULTIMATE.start_main_~tmp~0#1.offset_75| 8))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))) (or (< .cse0 0) (< |v_ULTIMATE.start_main_~tmp~0#1.offset_75| 0) (< |c_ULTIMATE.start_main_~tree~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1.offset_75|) (let ((.cse2 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 |c_ULTIMATE.start_main_~tmpList~0#1.base|)))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse5))) (let ((.cse1 (select (select .cse4 .cse3) .cse0))) (and (<= .cse1 |c_ULTIMATE.start_main_~tmpList~0#1.offset|) (<= 0 .cse1) (= (select (select .cse2 .cse3) .cse0) |c_ULTIMATE.start_main_~tmpList~0#1.base|))))))))))) is different from false [2021-12-07 01:19:16,085 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:19:16,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1128 treesize of output 918 [2021-12-07 01:19:16,096 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:19:16,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 908 treesize of output 638 [2021-12-07 01:19:16,100 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:19:16,876 INFO L354 Elim1Store]: treesize reduction 197, result has 70.0 percent of original size [2021-12-07 01:19:16,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 433569 treesize of output 403768 [2021-12-07 01:19:18,079 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:19:18,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:19:24,799 WARN L227 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 306 DAG size of output: 206 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-07 01:19:24,800 INFO L354 Elim1Store]: treesize reduction 455, result has 60.3 percent of original size [2021-12-07 01:19:24,813 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 16 new quantified variables, introduced 66 case distinctions, treesize of input 10279282 treesize of output 9362967 [2021-12-07 01:19:47,297 WARN L227 SmtUtils]: Spent 22.47s on a formula simplification that was a NOOP. DAG size: 13330 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-07 01:20:09,463 WARN L227 SmtUtils]: Spent 22.13s on a formula simplification that was a NOOP. DAG size: 13302 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-07 01:20:10,233 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:20:10,233 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:20:14,869 INFO L354 Elim1Store]: treesize reduction 69, result has 86.4 percent of original size [2021-12-07 01:20:14,886 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 2 disjoint index pairs (out of 36 index pairs), introduced 12 new quantified variables, introduced 34 case distinctions, treesize of input 10709140 treesize of output 9143397 [2021-12-07 01:26:33,184 WARN L227 SmtUtils]: Spent 6.30m on a formula simplification. DAG size of input: 13596 DAG size of output: 13579 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-07 01:27:00,039 WARN L227 SmtUtils]: Spent 26.79s on a formula simplification that was a NOOP. DAG size: 13570 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-07 01:27:01,393 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:27:02,899 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:27:02,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 10825815 treesize of output 10075973