./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-optional-1.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_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/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_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-optional-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/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_5256e11a-e4f2-4c03-934f-293c43069cf5/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 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 01:42:56,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 01:42:56,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 01:42:56,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 01:42:56,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 01:42:56,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 01:42:56,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 01:42:56,564 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 01:42:56,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 01:42:56,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 01:42:56,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 01:42:56,570 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 01:42:56,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 01:42:56,571 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 01:42:56,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 01:42:56,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 01:42:56,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 01:42:56,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 01:42:56,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 01:42:56,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 01:42:56,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 01:42:56,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 01:42:56,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 01:42:56,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 01:42:56,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 01:42:56,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 01:42:56,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 01:42:56,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 01:42:56,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 01:42:56,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 01:42:56,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 01:42:56,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 01:42:56,595 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 01:42:56,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 01:42:56,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 01:42:56,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 01:42:56,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 01:42:56,598 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 01:42:56,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 01:42:56,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 01:42:56,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 01:42:56,600 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-07 01:42:56,623 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 01:42:56,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 01:42:56,624 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 01:42:56,624 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 01:42:56,625 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 01:42:56,625 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 01:42:56,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 01:42:56,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 01:42:56,626 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 01:42:56,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 01:42:56,626 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 01:42:56,627 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-07 01:42:56,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 01:42:56,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 01:42:56,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 01:42:56,627 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-07 01:42:56,627 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-07 01:42:56,628 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-07 01:42:56,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 01:42:56,628 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-07 01:42:56,628 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 01:42:56,628 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 01:42:56,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 01:42:56,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 01:42:56,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 01:42:56,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:42:56,629 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 01:42:56,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 01:42:56,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 01:42:56,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 01:42:56,630 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 01:42:56,630 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_5256e11a-e4f2-4c03-934f-293c43069cf5/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_5256e11a-e4f2-4c03-934f-293c43069cf5/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 -> 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 [2021-12-07 01:42:56,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 01:42:56,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 01:42:56,836 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 01:42:56,837 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 01:42:56,838 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 01:42:56,839 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/forester-heap/dll-optional-1.i [2021-12-07 01:42:56,883 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/data/77ee954eb/6c4304dc62624b5885270942850230e5/FLAGc06bb446b [2021-12-07 01:42:57,316 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 01:42:57,316 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/sv-benchmarks/c/forester-heap/dll-optional-1.i [2021-12-07 01:42:57,325 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/data/77ee954eb/6c4304dc62624b5885270942850230e5/FLAGc06bb446b [2021-12-07 01:42:57,334 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/data/77ee954eb/6c4304dc62624b5885270942850230e5 [2021-12-07 01:42:57,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 01:42:57,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 01:42:57,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 01:42:57,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 01:42:57,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 01:42:57,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:42:57" (1/1) ... [2021-12-07 01:42:57,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f87738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:57, skipping insertion in model container [2021-12-07 01:42:57,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:42:57" (1/1) ... [2021-12-07 01:42:57,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 01:42:57,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 01:42:57,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/sv-benchmarks/c/forester-heap/dll-optional-1.i[22753,22766] [2021-12-07 01:42:57,580 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:42:57,586 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 01:42:57,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/sv-benchmarks/c/forester-heap/dll-optional-1.i[22753,22766] [2021-12-07 01:42:57,613 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:42:57,633 INFO L208 MainTranslator]: Completed translation [2021-12-07 01:42:57,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:57 WrapperNode [2021-12-07 01:42:57,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 01:42:57,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 01:42:57,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 01:42:57,634 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 01:42:57,640 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:42:57" (1/1) ... [2021-12-07 01:42:57,650 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:42:57" (1/1) ... [2021-12-07 01:42:57,667 INFO L137 Inliner]: procedures = 119, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 140 [2021-12-07 01:42:57,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 01:42:57,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 01:42:57,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 01:42:57,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 01:42:57,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:57" (1/1) ... [2021-12-07 01:42:57,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:57" (1/1) ... [2021-12-07 01:42:57,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:57" (1/1) ... [2021-12-07 01:42:57,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:57" (1/1) ... [2021-12-07 01:42:57,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:57" (1/1) ... [2021-12-07 01:42:57,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:57" (1/1) ... [2021-12-07 01:42:57,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:57" (1/1) ... [2021-12-07 01:42:57,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 01:42:57,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 01:42:57,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 01:42:57,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 01:42:57,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:57" (1/1) ... [2021-12-07 01:42:57,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:42:57,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:42:57,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 01:42:57,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 01:42:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-07 01:42:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-07 01:42:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-07 01:42:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 01:42:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-07 01:42:57,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-07 01:42:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-07 01:42:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 01:42:57,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 01:42:57,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 01:42:57,818 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 01:42:57,819 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 01:42:58,113 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 01:42:58,121 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 01:42:58,122 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-07 01:42:58,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:42:58 BoogieIcfgContainer [2021-12-07 01:42:58,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 01:42:58,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 01:42:58,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 01:42:58,130 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 01:42:58,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:42:57" (1/3) ... [2021-12-07 01:42:58,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736ccf90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:42:58, skipping insertion in model container [2021-12-07 01:42:58,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:42:57" (2/3) ... [2021-12-07 01:42:58,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736ccf90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:42:58, skipping insertion in model container [2021-12-07 01:42:58,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:42:58" (3/3) ... [2021-12-07 01:42:58,133 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2021-12-07 01:42:58,138 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 01:42:58,138 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2021-12-07 01:42:58,173 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 01:42:58,178 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:42:58,178 INFO L340 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2021-12-07 01:42:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 153 states, 80 states have (on average 2.1125) internal successors, (169), 152 states have internal predecessors, (169), 0 states have call successors, (0), 0 states 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:42:58,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-07 01:42:58,195 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:42:58,196 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-07 01:42:58,196 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:42:58,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:42:58,200 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-07 01:42:58,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:42:58,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226289400] [2021-12-07 01:42:58,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:42:58,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:42:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,328 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:42:58,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:42:58,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226289400] [2021-12-07 01:42:58,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226289400] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:42:58,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:42:58,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:42:58,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768612514] [2021-12-07 01:42:58,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:42:58,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:42:58,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:42:58,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:42:58,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:42:58,357 INFO L87 Difference]: Start difference. First operand has 153 states, 80 states have (on average 2.1125) internal successors, (169), 152 states have internal predecessors, (169), 0 states have call successors, (0), 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:42:58,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:42:58,471 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2021-12-07 01:42:58,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:42:58,473 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:42:58,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:42:58,481 INFO L225 Difference]: With dead ends: 154 [2021-12-07 01:42:58,481 INFO L226 Difference]: Without dead ends: 150 [2021-12-07 01:42:58,482 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:42:58,485 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:42:58,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 87 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:42:58,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-07 01:42:58,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 144. [2021-12-07 01:42:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 82 states have (on average 1.9024390243902438) internal successors, (156), 143 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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:42:58,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2021-12-07 01:42:58,523 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 3 [2021-12-07 01:42:58,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:42:58,523 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2021-12-07 01:42:58,523 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:42:58,524 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2021-12-07 01:42:58,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-07 01:42:58,524 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:42:58,524 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-07 01:42:58,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 01:42:58,524 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:42:58,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:42:58,526 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-07 01:42:58,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:42:58,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491945179] [2021-12-07 01:42:58,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:42:58,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:42:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,559 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:42:58,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:42:58,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491945179] [2021-12-07 01:42:58,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491945179] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:42:58,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:42:58,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:42:58,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080208437] [2021-12-07 01:42:58,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:42:58,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:42:58,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:42:58,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:42:58,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:42:58,562 INFO L87 Difference]: Start difference. First operand 144 states and 156 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:42:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:42:58,636 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2021-12-07 01:42:58,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:42:58,637 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:42:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:42:58,638 INFO L225 Difference]: With dead ends: 139 [2021-12-07 01:42:58,638 INFO L226 Difference]: Without dead ends: 139 [2021-12-07 01:42:58,638 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:42:58,639 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 113 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:42:58,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 100 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:42:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-12-07 01:42:58,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2021-12-07 01:42:58,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 82 states have (on average 1.7926829268292683) internal successors, (147), 134 states have internal predecessors, (147), 0 states have call successors, (0), 0 states 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:42:58,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2021-12-07 01:42:58,648 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 3 [2021-12-07 01:42:58,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:42:58,649 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2021-12-07 01:42:58,649 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:42:58,649 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2021-12-07 01:42:58,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-07 01:42:58,649 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:42:58,650 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:42:58,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 01:42:58,650 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:42:58,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:42:58,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656077, now seen corresponding path program 1 times [2021-12-07 01:42:58,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:42:58,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028326745] [2021-12-07 01:42:58,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:42:58,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:42:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,731 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:42:58,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:42:58,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028326745] [2021-12-07 01:42:58,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028326745] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:42:58,732 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:42:58,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:42:58,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176331773] [2021-12-07 01:42:58,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:42:58,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:42:58,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:42:58,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:42:58,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:42:58,734 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states 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:42:58,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:42:58,879 INFO L93 Difference]: Finished difference Result 179 states and 196 transitions. [2021-12-07 01:42:58,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:42:58,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-12-07 01:42:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:42:58,881 INFO L225 Difference]: With dead ends: 179 [2021-12-07 01:42:58,881 INFO L226 Difference]: Without dead ends: 179 [2021-12-07 01:42:58,881 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:42:58,883 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 51 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:42:58,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 330 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:42:58,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-12-07 01:42:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 134. [2021-12-07 01:42:58,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 82 states have (on average 1.7804878048780488) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states 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:42:58,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2021-12-07 01:42:58,893 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 12 [2021-12-07 01:42:58,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:42:58,894 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2021-12-07 01:42:58,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states 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:42:58,894 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2021-12-07 01:42:58,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-07 01:42:58,895 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:42:58,895 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:42:58,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 01:42:58,895 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:42:58,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:42:58,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656076, now seen corresponding path program 1 times [2021-12-07 01:42:58,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:42:58,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288463621] [2021-12-07 01:42:58,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:42:58,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:42:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:58,976 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:42:58,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:42:58,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288463621] [2021-12-07 01:42:58,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288463621] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:42:58,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:42:58,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:42:58,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317606608] [2021-12-07 01:42:58,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:42:58,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:42:58,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:42:58,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:42:58,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:42:58,978 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states 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:42:59,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:42:59,093 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2021-12-07 01:42:59,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:42:59,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-12-07 01:42:59,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:42:59,095 INFO L225 Difference]: With dead ends: 133 [2021-12-07 01:42:59,095 INFO L226 Difference]: Without dead ends: 133 [2021-12-07 01:42:59,095 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:42:59,096 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 2 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:42:59,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 366 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:42:59,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-07 01:42:59,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-12-07 01:42:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 82 states have (on average 1.7682926829268293) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:42:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2021-12-07 01:42:59,103 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 12 [2021-12-07 01:42:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:42:59,103 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2021-12-07 01:42:59,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states 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:42:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2021-12-07 01:42:59,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-07 01:42:59,104 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:42:59,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:42:59,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-07 01:42:59,104 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:42:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:42:59,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115696, now seen corresponding path program 1 times [2021-12-07 01:42:59,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:42:59,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133714981] [2021-12-07 01:42:59,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:42:59,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:42:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:59,159 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:42:59,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:42:59,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133714981] [2021-12-07 01:42:59,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133714981] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:42:59,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:42:59,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:42:59,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332038056] [2021-12-07 01:42:59,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:42:59,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:42:59,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:42:59,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:42:59,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:42:59,161 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:42:59,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:42:59,250 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2021-12-07 01:42:59,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:42:59,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-07 01:42:59,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:42:59,252 INFO L225 Difference]: With dead ends: 134 [2021-12-07 01:42:59,252 INFO L226 Difference]: Without dead ends: 134 [2021-12-07 01:42:59,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:42:59,253 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 183 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:42:59,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 75 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:42:59,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-07 01:42:59,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2021-12-07 01:42:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 88 states have (on average 1.6136363636363635) internal successors, (142), 124 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:42:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2021-12-07 01:42:59,259 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 13 [2021-12-07 01:42:59,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:42:59,259 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2021-12-07 01:42:59,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:42:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2021-12-07 01:42:59,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-07 01:42:59,260 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:42:59,260 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:42:59,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-07 01:42:59,260 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:42:59,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:42:59,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115697, now seen corresponding path program 1 times [2021-12-07 01:42:59,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:42:59,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579871661] [2021-12-07 01:42:59,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:42:59,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:42:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:59,310 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:42:59,310 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:42:59,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579871661] [2021-12-07 01:42:59,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579871661] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:42:59,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:42:59,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:42:59,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256681076] [2021-12-07 01:42:59,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:42:59,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:42:59,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:42:59,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:42:59,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:42:59,312 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:42:59,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:42:59,435 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2021-12-07 01:42:59,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:42:59,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-07 01:42:59,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:42:59,436 INFO L225 Difference]: With dead ends: 182 [2021-12-07 01:42:59,437 INFO L226 Difference]: Without dead ends: 182 [2021-12-07 01:42:59,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:42:59,438 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 187 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:42:59,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 118 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:42:59,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-07 01:42:59,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 156. [2021-12-07 01:42:59,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 155 states have internal predecessors, (183), 0 states have call successors, (0), 0 states 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:42:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2021-12-07 01:42:59,446 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 13 [2021-12-07 01:42:59,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:42:59,446 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2021-12-07 01:42:59,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:42:59,447 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2021-12-07 01:42:59,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-07 01:42:59,447 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:42:59,448 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:42:59,448 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-07 01:42:59,448 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:42:59,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:42:59,449 INFO L85 PathProgramCache]: Analyzing trace with hash -288943149, now seen corresponding path program 1 times [2021-12-07 01:42:59,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:42:59,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747375840] [2021-12-07 01:42:59,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:42:59,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:42:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:59,497 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:42:59,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:42:59,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747375840] [2021-12-07 01:42:59,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747375840] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:42:59,498 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:42:59,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:42:59,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953994439] [2021-12-07 01:42:59,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:42:59,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:42:59,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:42:59,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:42:59,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:42:59,500 INFO L87 Difference]: Start difference. First operand 156 states and 183 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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:42:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:42:59,586 INFO L93 Difference]: Finished difference Result 155 states and 181 transitions. [2021-12-07 01:42:59,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:42:59,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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:42:59,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:42:59,587 INFO L225 Difference]: With dead ends: 155 [2021-12-07 01:42:59,588 INFO L226 Difference]: Without dead ends: 155 [2021-12-07 01:42:59,588 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:42:59,589 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 9 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:42:59,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 308 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:42:59,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-07 01:42:59,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2021-12-07 01:42:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 119 states have (on average 1.5210084033613445) internal successors, (181), 154 states have internal predecessors, (181), 0 states have call successors, (0), 0 states 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:42:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2021-12-07 01:42:59,596 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 16 [2021-12-07 01:42:59,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:42:59,596 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2021-12-07 01:42:59,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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:42:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2021-12-07 01:42:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-07 01:42:59,597 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:42:59,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:42:59,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-07 01:42:59,598 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:42:59,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:42:59,598 INFO L85 PathProgramCache]: Analyzing trace with hash -288943148, now seen corresponding path program 1 times [2021-12-07 01:42:59,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:42:59,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95482585] [2021-12-07 01:42:59,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:42:59,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:42:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:59,659 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:42:59,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:42:59,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95482585] [2021-12-07 01:42:59,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95482585] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:42:59,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:42:59,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:42:59,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754901246] [2021-12-07 01:42:59,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:42:59,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:42:59,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:42:59,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:42:59,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:42:59,660 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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:42:59,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:42:59,776 INFO L93 Difference]: Finished difference Result 154 states and 179 transitions. [2021-12-07 01:42:59,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:42:59,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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:42:59,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:42:59,778 INFO L225 Difference]: With dead ends: 154 [2021-12-07 01:42:59,778 INFO L226 Difference]: Without dead ends: 154 [2021-12-07 01:42:59,778 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:42:59,779 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:42:59,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 299 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:42:59,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-12-07 01:42:59,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2021-12-07 01:42:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.504201680672269) internal successors, (179), 153 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:42:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2021-12-07 01:42:59,783 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 16 [2021-12-07 01:42:59,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:42:59,783 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2021-12-07 01:42:59,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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:42:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2021-12-07 01:42:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-07 01:42:59,784 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:42:59,784 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:42:59,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-07 01:42:59,785 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:42:59,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:42:59,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1504363226, now seen corresponding path program 1 times [2021-12-07 01:42:59,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:42:59,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29642096] [2021-12-07 01:42:59,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:42:59,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:42:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:42:59,813 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:42:59,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:42:59,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29642096] [2021-12-07 01:42:59,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29642096] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:42:59,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:42:59,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:42:59,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058517312] [2021-12-07 01:42:59,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:42:59,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:42:59,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:42:59,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:42:59,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:42:59,815 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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:42:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:42:59,908 INFO L93 Difference]: Finished difference Result 173 states and 192 transitions. [2021-12-07 01:42:59,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:42:59,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-07 01:42:59,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:42:59,910 INFO L225 Difference]: With dead ends: 173 [2021-12-07 01:42:59,910 INFO L226 Difference]: Without dead ends: 173 [2021-12-07 01:42:59,910 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:42:59,911 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 174 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:42:59,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 168 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:42:59,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-12-07 01:42:59,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 154. [2021-12-07 01:42:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.4873949579831933) internal successors, (177), 153 states have internal predecessors, (177), 0 states have call successors, (0), 0 states 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:42:59,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 177 transitions. [2021-12-07 01:42:59,917 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 177 transitions. Word has length 18 [2021-12-07 01:42:59,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:42:59,917 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 177 transitions. [2021-12-07 01:42:59,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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:42:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 177 transitions. [2021-12-07 01:42:59,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-07 01:42:59,919 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:42:59,919 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] [2021-12-07 01:42:59,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-07 01:42:59,919 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:42:59,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:42:59,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1253394517, now seen corresponding path program 1 times [2021-12-07 01:42:59,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:42:59,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572359327] [2021-12-07 01:42:59,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:42:59,921 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:42:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,008 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:43:00,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:00,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572359327] [2021-12-07 01:43:00,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572359327] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:00,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:00,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:43:00,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526026793] [2021-12-07 01:43:00,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:00,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 01:43:00,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:00,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 01:43:00,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:43:00,009 INFO L87 Difference]: Start difference. First operand 154 states and 177 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:00,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:00,220 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2021-12-07 01:43:00,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 01:43:00,221 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-07 01:43:00,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:00,222 INFO L225 Difference]: With dead ends: 155 [2021-12-07 01:43:00,222 INFO L226 Difference]: Without dead ends: 155 [2021-12-07 01:43:00,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-07 01:43:00,223 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 172 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:00,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 257 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:43:00,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-07 01:43:00,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2021-12-07 01:43:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 119 states have (on average 1.4789915966386555) internal successors, (176), 152 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2021-12-07 01:43:00,226 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 20 [2021-12-07 01:43:00,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:00,226 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2021-12-07 01:43:00,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:00,227 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2021-12-07 01:43:00,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-07 01:43:00,227 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:00,227 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] [2021-12-07 01:43:00,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-07 01:43:00,227 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:00,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:00,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1253394518, now seen corresponding path program 1 times [2021-12-07 01:43:00,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:00,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306512405] [2021-12-07 01:43:00,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:00,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,324 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:43:00,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:00,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306512405] [2021-12-07 01:43:00,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306512405] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:00,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:00,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 01:43:00,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624548808] [2021-12-07 01:43:00,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:00,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:43:00,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:00,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:43:00,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:43:00,327 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:00,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:00,661 INFO L93 Difference]: Finished difference Result 146 states and 167 transitions. [2021-12-07 01:43:00,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-07 01:43:00,662 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-07 01:43:00,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:00,663 INFO L225 Difference]: With dead ends: 146 [2021-12-07 01:43:00,663 INFO L226 Difference]: Without dead ends: 146 [2021-12-07 01:43:00,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2021-12-07 01:43:00,664 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 173 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:00,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 264 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:43:00,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-12-07 01:43:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 134. [2021-12-07 01:43:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 111 states have (on average 1.4054054054054055) internal successors, (156), 133 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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:43:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 156 transitions. [2021-12-07 01:43:00,669 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 156 transitions. Word has length 20 [2021-12-07 01:43:00,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:00,669 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 156 transitions. [2021-12-07 01:43:00,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:00,670 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 156 transitions. [2021-12-07 01:43:00,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-07 01:43:00,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:00,671 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] [2021-12-07 01:43:00,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-07 01:43:00,671 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:00,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:00,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1737058081, now seen corresponding path program 1 times [2021-12-07 01:43:00,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:00,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107811609] [2021-12-07 01:43:00,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:00,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,695 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:43:00,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:00,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107811609] [2021-12-07 01:43:00,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107811609] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:00,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:00,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:43:00,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332701407] [2021-12-07 01:43:00,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:00,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:43:00,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:00,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:43:00,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:43:00,696 INFO L87 Difference]: Start difference. First operand 134 states and 156 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:00,711 INFO L93 Difference]: Finished difference Result 160 states and 190 transitions. [2021-12-07 01:43:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:43:00,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-07 01:43:00,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:00,712 INFO L225 Difference]: With dead ends: 160 [2021-12-07 01:43:00,712 INFO L226 Difference]: Without dead ends: 160 [2021-12-07 01:43:00,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:43:00,713 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 21 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:00,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 316 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:43:00,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2021-12-07 01:43:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 138. [2021-12-07 01:43:00,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 115 states have (on average 1.391304347826087) internal successors, (160), 137 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:00,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 160 transitions. [2021-12-07 01:43:00,718 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 160 transitions. Word has length 21 [2021-12-07 01:43:00,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:00,718 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 160 transitions. [2021-12-07 01:43:00,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:00,719 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 160 transitions. [2021-12-07 01:43:00,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-07 01:43:00,719 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:00,719 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:43:00,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-07 01:43:00,720 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:00,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:00,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1420838518, now seen corresponding path program 1 times [2021-12-07 01:43:00,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:00,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981923041] [2021-12-07 01:43:00,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:00,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,743 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:43:00,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:00,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981923041] [2021-12-07 01:43:00,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981923041] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:00,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:00,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:43:00,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988766884] [2021-12-07 01:43:00,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:00,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:43:00,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:00,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:43:00,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:43:00,745 INFO L87 Difference]: Start difference. First operand 138 states and 160 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:43:00,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:00,750 INFO L93 Difference]: Finished difference Result 140 states and 162 transitions. [2021-12-07 01:43:00,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:43:00,751 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:43:00,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:00,751 INFO L225 Difference]: With dead ends: 140 [2021-12-07 01:43:00,751 INFO L226 Difference]: Without dead ends: 140 [2021-12-07 01:43:00,752 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:43:00,752 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 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:43:00,752 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:43:00,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-07 01:43:00,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2021-12-07 01:43:00,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 139 states have internal predecessors, (162), 0 states have call successors, (0), 0 states 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:43:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2021-12-07 01:43:00,755 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 23 [2021-12-07 01:43:00,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:00,756 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2021-12-07 01:43:00,756 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:43:00,756 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2021-12-07 01:43:00,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-07 01:43:00,756 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:00,756 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:43:00,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-07 01:43:00,757 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:00,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:00,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1628462334, now seen corresponding path program 1 times [2021-12-07 01:43:00,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:00,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561912230] [2021-12-07 01:43:00,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:00,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:00,808 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:43:00,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:00,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561912230] [2021-12-07 01:43:00,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561912230] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:00,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:00,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:43:00,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443996252] [2021-12-07 01:43:00,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:00,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 01:43:00,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:00,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 01:43:00,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:43:00,810 INFO L87 Difference]: Start difference. First operand 140 states and 162 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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:43:00,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:00,971 INFO L93 Difference]: Finished difference Result 269 states and 312 transitions. [2021-12-07 01:43:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 01:43:00,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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:43:00,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:00,973 INFO L225 Difference]: With dead ends: 269 [2021-12-07 01:43:00,973 INFO L226 Difference]: Without dead ends: 269 [2021-12-07 01:43:00,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:43:00,974 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 165 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:00,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 334 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:00,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-12-07 01:43:00,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 154. [2021-12-07 01:43:00,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 153 states have internal predecessors, (180), 0 states have call successors, (0), 0 states 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:43:00,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2021-12-07 01:43:00,979 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 23 [2021-12-07 01:43:00,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:00,980 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2021-12-07 01:43:00,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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:43:00,980 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2021-12-07 01:43:00,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-07 01:43:00,981 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:00,981 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:43:00,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-07 01:43:00,981 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:00,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:00,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1628462335, now seen corresponding path program 1 times [2021-12-07 01:43:00,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:00,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789677010] [2021-12-07 01:43:00,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:00,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,041 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:43:01,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:01,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789677010] [2021-12-07 01:43:01,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789677010] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:01,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:01,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 01:43:01,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193469556] [2021-12-07 01:43:01,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:01,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 01:43:01,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:01,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 01:43:01,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:43:01,042 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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:43:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:01,260 INFO L93 Difference]: Finished difference Result 279 states and 325 transitions. [2021-12-07 01:43:01,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-07 01:43:01,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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:43:01,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:01,261 INFO L225 Difference]: With dead ends: 279 [2021-12-07 01:43:01,262 INFO L226 Difference]: Without dead ends: 279 [2021-12-07 01:43:01,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-12-07 01:43:01,262 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 164 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:01,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 469 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-12-07 01:43:01,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 150. [2021-12-07 01:43:01,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 149 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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:43:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 174 transitions. [2021-12-07 01:43:01,266 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 174 transitions. Word has length 23 [2021-12-07 01:43:01,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:01,266 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 174 transitions. [2021-12-07 01:43:01,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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:43:01,266 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 174 transitions. [2021-12-07 01:43:01,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-07 01:43:01,267 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:01,267 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:43:01,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-07 01:43:01,267 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:01,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:01,270 INFO L85 PathProgramCache]: Analyzing trace with hash 375423567, now seen corresponding path program 1 times [2021-12-07 01:43:01,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:01,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427722733] [2021-12-07 01:43:01,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:01,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,339 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:43:01,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:01,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427722733] [2021-12-07 01:43:01,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427722733] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:01,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:01,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 01:43:01,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119742628] [2021-12-07 01:43:01,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:01,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 01:43:01,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:01,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 01:43:01,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:43:01,341 INFO L87 Difference]: Start difference. First operand 150 states and 174 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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:43:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:01,527 INFO L93 Difference]: Finished difference Result 225 states and 256 transitions. [2021-12-07 01:43:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:43:01,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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:43:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:01,529 INFO L225 Difference]: With dead ends: 225 [2021-12-07 01:43:01,529 INFO L226 Difference]: Without dead ends: 225 [2021-12-07 01:43:01,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2021-12-07 01:43:01,530 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 229 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:01,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 360 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:01,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-12-07 01:43:01,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 156. [2021-12-07 01:43:01,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 133 states have (on average 1.3609022556390977) internal successors, (181), 155 states have internal predecessors, (181), 0 states have call successors, (0), 0 states 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:43:01,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 181 transitions. [2021-12-07 01:43:01,533 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 181 transitions. Word has length 25 [2021-12-07 01:43:01,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:01,533 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 181 transitions. [2021-12-07 01:43:01,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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:43:01,534 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 181 transitions. [2021-12-07 01:43:01,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-07 01:43:01,534 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:01,534 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:43:01,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-07 01:43:01,534 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:01,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:01,535 INFO L85 PathProgramCache]: Analyzing trace with hash 729704446, now seen corresponding path program 1 times [2021-12-07 01:43:01,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:01,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133210267] [2021-12-07 01:43:01,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:01,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:01,599 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:43:01,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:01,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133210267] [2021-12-07 01:43:01,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133210267] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:01,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:01,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:43:01,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487208026] [2021-12-07 01:43:01,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:01,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 01:43:01,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:01,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 01:43:01,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:43:01,602 INFO L87 Difference]: Start difference. First operand 156 states and 181 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 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:43:01,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:01,879 INFO L93 Difference]: Finished difference Result 318 states and 365 transitions. [2021-12-07 01:43:01,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-07 01:43:01,880 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 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:43:01,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:01,881 INFO L225 Difference]: With dead ends: 318 [2021-12-07 01:43:01,881 INFO L226 Difference]: Without dead ends: 318 [2021-12-07 01:43:01,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-12-07 01:43:01,882 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 353 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:01,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [353 Valid, 459 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:43:01,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-12-07 01:43:01,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 169. [2021-12-07 01:43:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 146 states have (on average 1.356164383561644) internal successors, (198), 168 states have internal predecessors, (198), 0 states have call successors, (0), 0 states 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:43:01,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 198 transitions. [2021-12-07 01:43:01,886 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 198 transitions. Word has length 27 [2021-12-07 01:43:01,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:01,887 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 198 transitions. [2021-12-07 01:43:01,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 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:43:01,887 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 198 transitions. [2021-12-07 01:43:01,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-07 01:43:01,887 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:01,887 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:43:01,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-07 01:43:01,887 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:01,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:01,888 INFO L85 PathProgramCache]: Analyzing trace with hash 729704447, now seen corresponding path program 1 times [2021-12-07 01:43:01,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:01,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027958764] [2021-12-07 01:43:01,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:01,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:02,022 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:43:02,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:02,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027958764] [2021-12-07 01:43:02,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027958764] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:02,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:02,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 01:43:02,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997217089] [2021-12-07 01:43:02,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:02,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 01:43:02,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:02,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 01:43:02,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:43:02,024 INFO L87 Difference]: Start difference. First operand 169 states and 198 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 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:43:02,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:02,337 INFO L93 Difference]: Finished difference Result 257 states and 295 transitions. [2021-12-07 01:43:02,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-07 01:43:02,338 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 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:43:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:02,339 INFO L225 Difference]: With dead ends: 257 [2021-12-07 01:43:02,339 INFO L226 Difference]: Without dead ends: 257 [2021-12-07 01:43:02,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2021-12-07 01:43:02,340 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 293 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:02,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 497 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:43:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-12-07 01:43:02,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 169. [2021-12-07 01:43:02,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 146 states have (on average 1.3493150684931507) internal successors, (197), 168 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:43:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2021-12-07 01:43:02,343 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 27 [2021-12-07 01:43:02,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:02,343 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2021-12-07 01:43:02,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 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:43:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2021-12-07 01:43:02,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-07 01:43:02,344 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:02,344 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] [2021-12-07 01:43:02,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-07 01:43:02,344 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:02,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:02,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1443803627, now seen corresponding path program 1 times [2021-12-07 01:43:02,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:02,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015219694] [2021-12-07 01:43:02,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:02,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:02,365 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:43:02,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:02,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015219694] [2021-12-07 01:43:02,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015219694] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:02,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:02,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:43:02,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785372975] [2021-12-07 01:43:02,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:02,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:43:02,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:02,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:43:02,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:43:02,367 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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:43:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:02,378 INFO L93 Difference]: Finished difference Result 181 states and 210 transitions. [2021-12-07 01:43:02,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:43:02,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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:43:02,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:02,379 INFO L225 Difference]: With dead ends: 181 [2021-12-07 01:43:02,379 INFO L226 Difference]: Without dead ends: 181 [2021-12-07 01:43:02,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:43:02,380 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 10 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:02,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 317 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:43:02,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-07 01:43:02,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 173. [2021-12-07 01:43:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 150 states have (on average 1.3333333333333333) internal successors, (200), 172 states have internal predecessors, (200), 0 states have call successors, (0), 0 states 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:43:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 200 transitions. [2021-12-07 01:43:02,383 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 200 transitions. Word has length 27 [2021-12-07 01:43:02,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:02,383 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 200 transitions. [2021-12-07 01:43:02,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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:43:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 200 transitions. [2021-12-07 01:43:02,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-07 01:43:02,384 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:02,384 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:43:02,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-07 01:43:02,384 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:02,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:02,384 INFO L85 PathProgramCache]: Analyzing trace with hash 17756513, now seen corresponding path program 1 times [2021-12-07 01:43:02,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:02,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569002689] [2021-12-07 01:43:02,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:02,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:02,417 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:43:02,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:02,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569002689] [2021-12-07 01:43:02,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569002689] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:02,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:02,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:43:02,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773414074] [2021-12-07 01:43:02,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:02,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:43:02,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:02,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:43:02,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:43:02,419 INFO L87 Difference]: Start difference. First operand 173 states and 200 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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:43:02,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:02,503 INFO L93 Difference]: Finished difference Result 182 states and 210 transitions. [2021-12-07 01:43:02,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:43:02,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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:43:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:02,504 INFO L225 Difference]: With dead ends: 182 [2021-12-07 01:43:02,504 INFO L226 Difference]: Without dead ends: 182 [2021-12-07 01:43:02,504 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:43:02,505 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 10 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:02,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 296 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:02,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-07 01:43:02,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2021-12-07 01:43:02,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 150 states have (on average 1.3266666666666667) internal successors, (199), 171 states have internal predecessors, (199), 0 states have call successors, (0), 0 states 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:43:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 199 transitions. [2021-12-07 01:43:02,508 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 199 transitions. Word has length 28 [2021-12-07 01:43:02,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:02,508 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 199 transitions. [2021-12-07 01:43:02,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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:43:02,508 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 199 transitions. [2021-12-07 01:43:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-07 01:43:02,509 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:02,509 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:43:02,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-07 01:43:02,509 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:02,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:02,509 INFO L85 PathProgramCache]: Analyzing trace with hash 17756514, now seen corresponding path program 1 times [2021-12-07 01:43:02,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:02,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231141581] [2021-12-07 01:43:02,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:02,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:02,550 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:43:02,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:02,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231141581] [2021-12-07 01:43:02,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231141581] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:02,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:02,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:43:02,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113377517] [2021-12-07 01:43:02,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:02,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:43:02,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:02,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:43:02,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:43:02,552 INFO L87 Difference]: Start difference. First operand 172 states and 199 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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:43:02,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:02,648 INFO L93 Difference]: Finished difference Result 171 states and 198 transitions. [2021-12-07 01:43:02,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:43:02,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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:43:02,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:02,650 INFO L225 Difference]: With dead ends: 171 [2021-12-07 01:43:02,650 INFO L226 Difference]: Without dead ends: 171 [2021-12-07 01:43:02,650 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:43:02,650 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 2 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:02,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 282 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:02,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-07 01:43:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2021-12-07 01:43:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.32) internal successors, (198), 170 states have internal predecessors, (198), 0 states have call successors, (0), 0 states 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:43:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 198 transitions. [2021-12-07 01:43:02,653 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 198 transitions. Word has length 28 [2021-12-07 01:43:02,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:02,654 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 198 transitions. [2021-12-07 01:43:02,654 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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:43:02,654 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 198 transitions. [2021-12-07 01:43:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-07 01:43:02,654 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:43:02,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-07 01:43:02,654 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:02,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:02,655 INFO L85 PathProgramCache]: Analyzing trace with hash -42480305, now seen corresponding path program 1 times [2021-12-07 01:43:02,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:02,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973816972] [2021-12-07 01:43:02,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:02,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:02,725 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:43:02,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:02,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973816972] [2021-12-07 01:43:02,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973816972] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:02,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:02,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-07 01:43:02,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438289692] [2021-12-07 01:43:02,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:02,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 01:43:02,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:02,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 01:43:02,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:43:02,727 INFO L87 Difference]: Start difference. First operand 171 states and 198 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:03,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:03,069 INFO L93 Difference]: Finished difference Result 251 states and 281 transitions. [2021-12-07 01:43:03,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-07 01:43:03,070 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-07 01:43:03,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:03,071 INFO L225 Difference]: With dead ends: 251 [2021-12-07 01:43:03,071 INFO L226 Difference]: Without dead ends: 251 [2021-12-07 01:43:03,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-12-07 01:43:03,071 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 290 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:03,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 636 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:43:03,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-12-07 01:43:03,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 171. [2021-12-07 01:43:03,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.3133333333333332) internal successors, (197), 170 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:43:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 197 transitions. [2021-12-07 01:43:03,075 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 197 transitions. Word has length 29 [2021-12-07 01:43:03,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:03,075 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 197 transitions. [2021-12-07 01:43:03,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:03,075 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 197 transitions. [2021-12-07 01:43:03,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-07 01:43:03,076 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:03,076 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] [2021-12-07 01:43:03,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-07 01:43:03,076 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:03,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:03,076 INFO L85 PathProgramCache]: Analyzing trace with hash 439757914, now seen corresponding path program 1 times [2021-12-07 01:43:03,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:03,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016547920] [2021-12-07 01:43:03,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:03,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:43:03,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:03,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016547920] [2021-12-07 01:43:03,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016547920] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:03,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286147156] [2021-12-07 01:43:03,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:03,127 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:03,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:03,128 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:03,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-07 01:43:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:03,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-07 01:43:03,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:03,238 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:43:03,243 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:43:03,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:03,273 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:43:03,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:03,279 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:43:03,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:03,319 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:43:03,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:03,325 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:43:03,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:03,348 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:43:03,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:03,359 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:43:03,470 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:03,471 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 15 treesize of output 7 [2021-12-07 01:43:03,476 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:03,477 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:03,478 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 15 treesize of output 10 [2021-12-07 01:43:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:43:03,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:03,941 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 21 treesize of output 19 [2021-12-07 01:43:03,944 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 19 treesize of output 17 [2021-12-07 01:43:03,948 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 21 [2021-12-07 01:43:03,952 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 22 treesize of output 20 [2021-12-07 01:43:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:43:03,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286147156] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:03,967 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:03,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2021-12-07 01:43:03,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345662199] [2021-12-07 01:43:03,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:03,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-07 01:43:03,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:03,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-07 01:43:03,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:43:03,969 INFO L87 Difference]: Start difference. First operand 171 states and 197 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:43:04,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:04,146 INFO L93 Difference]: Finished difference Result 194 states and 222 transitions. [2021-12-07 01:43:04,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:43:04,147 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-07 01:43:04,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:04,147 INFO L225 Difference]: With dead ends: 194 [2021-12-07 01:43:04,148 INFO L226 Difference]: Without dead ends: 194 [2021-12-07 01:43:04,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2021-12-07 01:43:04,148 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 131 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:04,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 521 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 271 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2021-12-07 01:43:04,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-12-07 01:43:04,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2021-12-07 01:43:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 171 states have (on average 1.286549707602339) internal successors, (220), 191 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:04,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 220 transitions. [2021-12-07 01:43:04,152 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 220 transitions. Word has length 29 [2021-12-07 01:43:04,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:04,152 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 220 transitions. [2021-12-07 01:43:04,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:43:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 220 transitions. [2021-12-07 01:43:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-07 01:43:04,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:04,152 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] [2021-12-07 01:43:04,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-07 01:43:04,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-07 01:43:04,353 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:04,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:04,353 INFO L85 PathProgramCache]: Analyzing trace with hash 79198050, now seen corresponding path program 1 times [2021-12-07 01:43:04,354 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:04,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132521423] [2021-12-07 01:43:04,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:04,354 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:43:04,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:04,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132521423] [2021-12-07 01:43:04,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132521423] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:04,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312121715] [2021-12-07 01:43:04,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:04,415 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:04,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:04,416 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:04,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-07 01:43:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:04,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-07 01:43:04,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:04,498 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:43:04,501 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:43:04,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:04,518 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:43:04,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:04,523 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:43:04,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:04,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 21 treesize of output 20 [2021-12-07 01:43:04,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:04,554 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:43:04,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:04,567 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:43:04,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:04,572 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:43:04,665 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:04,665 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 15 treesize of output 7 [2021-12-07 01:43:04,669 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:04,670 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:04,671 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 15 treesize of output 10 [2021-12-07 01:43:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:43:04,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:09,078 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 21 treesize of output 19 [2021-12-07 01:43:09,080 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 19 treesize of output 17 [2021-12-07 01:43:09,083 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 21 [2021-12-07 01:43:09,086 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 22 treesize of output 20 [2021-12-07 01:43:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:43:09,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312121715] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:09,098 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:09,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2021-12-07 01:43:09,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118576631] [2021-12-07 01:43:09,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:09,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-07 01:43:09,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:09,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-07 01:43:09,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:43:09,099 INFO L87 Difference]: Start difference. First operand 192 states and 220 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:43:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:09,294 INFO L93 Difference]: Finished difference Result 233 states and 264 transitions. [2021-12-07 01:43:09,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:43:09,295 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-07 01:43:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:09,296 INFO L225 Difference]: With dead ends: 233 [2021-12-07 01:43:09,296 INFO L226 Difference]: Without dead ends: 233 [2021-12-07 01:43:09,296 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-07 01:43:09,297 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 292 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:09,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 387 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 248 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2021-12-07 01:43:09,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-12-07 01:43:09,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 184. [2021-12-07 01:43:09,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 163 states have (on average 1.3006134969325154) internal successors, (212), 183 states have internal predecessors, (212), 0 states have call successors, (0), 0 states 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:43:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 212 transitions. [2021-12-07 01:43:09,300 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 212 transitions. Word has length 29 [2021-12-07 01:43:09,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:09,300 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 212 transitions. [2021-12-07 01:43:09,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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:43:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 212 transitions. [2021-12-07 01:43:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-07 01:43:09,301 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:09,301 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:43:09,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-07 01:43:09,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-07 01:43:09,502 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:09,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:09,503 INFO L85 PathProgramCache]: Analyzing trace with hash -469775188, now seen corresponding path program 1 times [2021-12-07 01:43:09,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:09,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42654794] [2021-12-07 01:43:09,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:09,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,658 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:43:09,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:09,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42654794] [2021-12-07 01:43:09,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42654794] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:09,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:09,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:43:09,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149183902] [2021-12-07 01:43:09,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:09,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:43:09,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:09,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:43:09,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:43:09,660 INFO L87 Difference]: Start difference. First operand 184 states and 212 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 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:43:09,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:09,842 INFO L93 Difference]: Finished difference Result 232 states and 263 transitions. [2021-12-07 01:43:09,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 01:43:09,843 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 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:43:09,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:09,844 INFO L225 Difference]: With dead ends: 232 [2021-12-07 01:43:09,844 INFO L226 Difference]: Without dead ends: 232 [2021-12-07 01:43:09,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-12-07 01:43:09,844 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 75 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:09,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 450 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:09,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-12-07 01:43:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 190. [2021-12-07 01:43:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.2958579881656804) internal successors, (219), 189 states have internal predecessors, (219), 0 states have call successors, (0), 0 states 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:43:09,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 219 transitions. [2021-12-07 01:43:09,847 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 219 transitions. Word has length 31 [2021-12-07 01:43:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:09,848 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 219 transitions. [2021-12-07 01:43:09,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 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:43:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 219 transitions. [2021-12-07 01:43:09,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-07 01:43:09,848 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:09,848 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:43:09,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-07 01:43:09,848 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:09,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:09,849 INFO L85 PathProgramCache]: Analyzing trace with hash 605010984, now seen corresponding path program 1 times [2021-12-07 01:43:09,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:09,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407581004] [2021-12-07 01:43:09,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:09,849 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:09,948 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:43:09,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:09,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407581004] [2021-12-07 01:43:09,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407581004] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:09,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:09,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-07 01:43:09,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123872502] [2021-12-07 01:43:09,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:09,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-07 01:43:09,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:09,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-07 01:43:09,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:43:09,950 INFO L87 Difference]: Start difference. First operand 190 states and 219 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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:43:10,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:10,366 INFO L93 Difference]: Finished difference Result 228 states and 254 transitions. [2021-12-07 01:43:10,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-07 01:43:10,366 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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:43:10,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:10,367 INFO L225 Difference]: With dead ends: 228 [2021-12-07 01:43:10,367 INFO L226 Difference]: Without dead ends: 228 [2021-12-07 01:43:10,368 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2021-12-07 01:43:10,368 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 190 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:10,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 681 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:43:10,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-12-07 01:43:10,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 187. [2021-12-07 01:43:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 166 states have (on average 1.2891566265060241) internal successors, (214), 186 states have internal predecessors, (214), 0 states have call successors, (0), 0 states 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:43:10,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 214 transitions. [2021-12-07 01:43:10,371 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 214 transitions. Word has length 34 [2021-12-07 01:43:10,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:10,372 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 214 transitions. [2021-12-07 01:43:10,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 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:43:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 214 transitions. [2021-12-07 01:43:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 01:43:10,372 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:10,372 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] [2021-12-07 01:43:10,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-07 01:43:10,372 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:10,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:10,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1443725027, now seen corresponding path program 1 times [2021-12-07 01:43:10,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:10,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537407549] [2021-12-07 01:43:10,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:10,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:10,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:10,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537407549] [2021-12-07 01:43:10,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537407549] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:10,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:10,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-07 01:43:10,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614209713] [2021-12-07 01:43:10,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:10,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 01:43:10,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:10,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 01:43:10,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:43:10,418 INFO L87 Difference]: Start difference. First operand 187 states and 214 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:10,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:10,537 INFO L93 Difference]: Finished difference Result 234 states and 265 transitions. [2021-12-07 01:43:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:43:10,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-07 01:43:10,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:10,538 INFO L225 Difference]: With dead ends: 234 [2021-12-07 01:43:10,538 INFO L226 Difference]: Without dead ends: 234 [2021-12-07 01:43:10,538 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:43:10,539 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 212 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:10,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 270 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:10,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-12-07 01:43:10,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 204. [2021-12-07 01:43:10,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.2677595628415301) internal successors, (232), 203 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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:43:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 232 transitions. [2021-12-07 01:43:10,542 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 232 transitions. Word has length 36 [2021-12-07 01:43:10,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:10,542 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 232 transitions. [2021-12-07 01:43:10,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 232 transitions. [2021-12-07 01:43:10,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 01:43:10,543 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:10,543 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] [2021-12-07 01:43:10,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-07 01:43:10,543 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:10,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:10,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1443714042, now seen corresponding path program 1 times [2021-12-07 01:43:10,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:10,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63668699] [2021-12-07 01:43:10,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:10,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:10,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:10,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63668699] [2021-12-07 01:43:10,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63668699] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:10,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:10,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:43:10,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704688904] [2021-12-07 01:43:10,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:10,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:43:10,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:10,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:43:10,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:43:10,569 INFO L87 Difference]: Start difference. First operand 204 states and 232 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:10,651 INFO L93 Difference]: Finished difference Result 221 states and 243 transitions. [2021-12-07 01:43:10,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:43:10,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-07 01:43:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:10,652 INFO L225 Difference]: With dead ends: 221 [2021-12-07 01:43:10,652 INFO L226 Difference]: Without dead ends: 221 [2021-12-07 01:43:10,653 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:43:10,653 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 124 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:10,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 136 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-07 01:43:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 206. [2021-12-07 01:43:10,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.2648648648648648) internal successors, (234), 205 states have internal predecessors, (234), 0 states have call successors, (0), 0 states 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:43:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 234 transitions. [2021-12-07 01:43:10,657 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 234 transitions. Word has length 36 [2021-12-07 01:43:10,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:10,657 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 234 transitions. [2021-12-07 01:43:10,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:10,657 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 234 transitions. [2021-12-07 01:43:10,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-07 01:43:10,657 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:10,657 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] [2021-12-07 01:43:10,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-07 01:43:10,658 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:10,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:10,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1805802628, now seen corresponding path program 1 times [2021-12-07 01:43:10,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:10,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11804449] [2021-12-07 01:43:10,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:10,658 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,785 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:43:10,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:10,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11804449] [2021-12-07 01:43:10,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11804449] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:10,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226473536] [2021-12-07 01:43:10,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:10,786 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:10,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:10,787 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:10,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-07 01:43:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:10,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-07 01:43:10,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:11,217 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:11,217 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 17 treesize of output 7 [2021-12-07 01:43:11,230 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:43:11,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:11,448 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:11,448 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 22 [2021-12-07 01:43:11,676 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:43:11,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226473536] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:11,677 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:11,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 29 [2021-12-07 01:43:11,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685582353] [2021-12-07 01:43:11,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:11,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-07 01:43:11,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:11,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-07 01:43:11,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2021-12-07 01:43:11,678 INFO L87 Difference]: Start difference. First operand 206 states and 234 transitions. Second operand has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 29 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:43:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:12,253 INFO L93 Difference]: Finished difference Result 239 states and 268 transitions. [2021-12-07 01:43:12,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-07 01:43:12,253 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 29 states have internal predecessors, (107), 0 states have call successors, (0), 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:43:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:12,254 INFO L225 Difference]: With dead ends: 239 [2021-12-07 01:43:12,255 INFO L226 Difference]: Without dead ends: 239 [2021-12-07 01:43:12,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=380, Invalid=1690, Unknown=0, NotChecked=0, Total=2070 [2021-12-07 01:43:12,256 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 204 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:12,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 855 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 596 Invalid, 0 Unknown, 210 Unchecked, 0.2s Time] [2021-12-07 01:43:12,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-07 01:43:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2021-12-07 01:43:12,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 216 states have (on average 1.2361111111111112) internal successors, (267), 236 states have internal predecessors, (267), 0 states have call successors, (0), 0 states 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:43:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 267 transitions. [2021-12-07 01:43:12,261 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 267 transitions. Word has length 37 [2021-12-07 01:43:12,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:12,261 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 267 transitions. [2021-12-07 01:43:12,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 29 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:43:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 267 transitions. [2021-12-07 01:43:12,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-07 01:43:12,262 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:12,262 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] [2021-12-07 01:43:12,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-07 01:43:12,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:12,463 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:12,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1898858598, now seen corresponding path program 1 times [2021-12-07 01:43:12,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:12,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627697251] [2021-12-07 01:43:12,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:12,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:12,764 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:43:12,764 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:12,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627697251] [2021-12-07 01:43:12,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627697251] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:12,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749521982] [2021-12-07 01:43:12,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:12,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:12,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:12,766 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:12,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-07 01:43:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:12,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-07 01:43:12,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:12,858 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:43:12,882 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:43:12,888 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:43:12,964 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:43:12,965 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:43:12,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:12,997 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 21 treesize of output 20 [2021-12-07 01:43:13,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:13,002 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 21 treesize of output 20 [2021-12-07 01:43:13,072 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:13,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 37 [2021-12-07 01:43:13,075 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 20 treesize of output 22 [2021-12-07 01:43:13,200 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-07 01:43:13,200 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-07 01:43:13,205 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 7 treesize of output 3 [2021-12-07 01:43:13,218 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:13,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-07 01:43:13,302 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:13,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-07 01:43:13,316 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-07 01:43:13,316 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-07 01:43:13,320 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 7 treesize of output 3 [2021-12-07 01:43:13,363 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:13,363 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 38 treesize of output 37 [2021-12-07 01:43:13,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 20 treesize of output 22 [2021-12-07 01:43:13,497 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 19 treesize of output 7 [2021-12-07 01:43:13,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:13,502 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:13,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2021-12-07 01:43:13,549 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:43:13,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:13,629 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1110 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1109 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1109) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-07 01:43:13,658 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1109 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1109) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1110 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2021-12-07 01:43:13,664 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1110 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1109 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1109) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-07 01:43:13,675 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1103) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1104 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1104))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1109)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-07 01:43:13,684 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1110 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1103) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1104) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1110)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1104 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1104))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1109)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-07 01:43:13,702 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1104 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1104))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1109)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1100 Int) (v_ArrVal_1110 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1100)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1103) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1104) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-07 01:43:13,732 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_9| Int)) (or (and (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1100 Int) (v_ArrVal_1110 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1100)) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_1103) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_1104) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1104 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_1104))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1109)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|) 0)))) is different from false [2021-12-07 01:43:13,869 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_9| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_67| Int)) (or (and (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1104 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_67| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_1104))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_67|) v_ArrVal_1109)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1104 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1100 Int) (v_ArrVal_1110 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_67| v_ArrVal_1100)) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_1103) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_67| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_9| v_ArrVal_1104) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_67|) v_ArrVal_1110) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_9|) 0)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_67|))) is different from false [2021-12-07 01:43:13,884 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:13,890 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:13,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 103 [2021-12-07 01:43:13,895 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:13,899 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:13,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 82 [2021-12-07 01:43:13,903 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:13,906 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:13,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 220 treesize of output 184 [2021-12-07 01:43:13,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:13,914 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:13,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 424 treesize of output 390 [2021-12-07 01:43:13,931 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 156 treesize of output 148 [2021-12-07 01:43:13,935 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 148 treesize of output 132 [2021-12-07 01:43:13,938 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 132 treesize of output 120 [2021-12-07 01:43:13,942 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:13,943 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 120 treesize of output 112 [2021-12-07 01:43:13,948 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:43:13,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-07 01:43:13,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749521982] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:13,999 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:13,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 16] total 39 [2021-12-07 01:43:14,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100053992] [2021-12-07 01:43:14,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:14,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-07 01:43:14,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:14,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-07 01:43:14,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=816, Unknown=8, NotChecked=520, Total=1482 [2021-12-07 01:43:14,001 INFO L87 Difference]: Start difference. First operand 237 states and 267 transitions. Second operand has 39 states, 39 states have (on average 2.641025641025641) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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:43:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:15,254 INFO L93 Difference]: Finished difference Result 395 states and 437 transitions. [2021-12-07 01:43:15,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-07 01:43:15,254 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.641025641025641) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 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:43:15,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:15,256 INFO L225 Difference]: With dead ends: 395 [2021-12-07 01:43:15,256 INFO L226 Difference]: Without dead ends: 395 [2021-12-07 01:43:15,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 56 SyntacticMatches, 12 SemanticMatches, 61 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=442, Invalid=2546, Unknown=14, NotChecked=904, Total=3906 [2021-12-07 01:43:15,257 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 333 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 2374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1429 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:15,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 1090 Invalid, 2374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 914 Invalid, 0 Unknown, 1429 Unchecked, 0.4s Time] [2021-12-07 01:43:15,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2021-12-07 01:43:15,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 264. [2021-12-07 01:43:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 243 states have (on average 1.2304526748971194) internal successors, (299), 263 states have internal predecessors, (299), 0 states have call successors, (0), 0 states 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:43:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 299 transitions. [2021-12-07 01:43:15,262 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 299 transitions. Word has length 38 [2021-12-07 01:43:15,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:15,262 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 299 transitions. [2021-12-07 01:43:15,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.641025641025641) internal successors, (103), 39 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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:43:15,262 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 299 transitions. [2021-12-07 01:43:15,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-07 01:43:15,262 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:15,262 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] [2021-12-07 01:43:15,296 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-07 01:43:15,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:15,463 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:15,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:15,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1535563358, now seen corresponding path program 1 times [2021-12-07 01:43:15,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:15,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868945716] [2021-12-07 01:43:15,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:15,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:15,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:15,688 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:43:15,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:15,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868945716] [2021-12-07 01:43:15,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868945716] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:15,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987723940] [2021-12-07 01:43:15,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:15,688 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:15,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:15,689 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:15,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-07 01:43:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:15,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-07 01:43:15,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:15,767 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:43:15,787 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:43:15,789 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:43:15,850 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:43:15,850 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:43:15,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:15,878 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 21 treesize of output 20 [2021-12-07 01:43:15,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:15,887 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 21 treesize of output 20 [2021-12-07 01:43:15,972 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:15,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 37 [2021-12-07 01:43:15,975 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 20 treesize of output 22 [2021-12-07 01:43:16,079 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:16,080 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-07 01:43:16,091 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-07 01:43:16,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-07 01:43:16,094 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 7 treesize of output 3 [2021-12-07 01:43:16,163 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:16,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-07 01:43:16,173 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-07 01:43:16,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-07 01:43:16,176 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 7 treesize of output 3 [2021-12-07 01:43:16,213 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:16,213 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 38 treesize of output 37 [2021-12-07 01:43:16,215 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 20 treesize of output 22 [2021-12-07 01:43:16,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:16,319 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:16,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2021-12-07 01:43:16,322 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 19 treesize of output 7 [2021-12-07 01:43:16,360 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:43:16,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:16,439 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1242 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-07 01:43:16,461 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1242 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1243 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2021-12-07 01:43:16,467 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1243 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1243) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1242 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2021-12-07 01:43:16,477 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1237) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1236) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1243 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1236))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1243)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-07 01:43:16,484 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1243 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1236))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1243)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1242 (Array Int Int))) (= (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1237) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1236) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1242)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-07 01:43:16,842 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:16,848 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:16,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 103 [2021-12-07 01:43:16,852 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:16,856 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:16,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 82 [2021-12-07 01:43:16,860 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:16,863 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:16,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 328 treesize of output 278 [2021-12-07 01:43:16,868 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:16,871 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:16,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 518 treesize of output 484 [2021-12-07 01:43:16,885 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 257 treesize of output 241 [2021-12-07 01:43:16,889 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 241 treesize of output 233 [2021-12-07 01:43:16,893 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 233 treesize of output 221 [2021-12-07 01:43:16,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:16,897 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 221 treesize of output 201 [2021-12-07 01:43:16,908 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 201 treesize of output 185 [2021-12-07 01:43:16,966 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:43:16,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987723940] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:16,967 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:16,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 40 [2021-12-07 01:43:16,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801377284] [2021-12-07 01:43:16,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:16,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-07 01:43:16,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:16,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-07 01:43:16,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1054, Unknown=18, NotChecked=350, Total=1560 [2021-12-07 01:43:16,969 INFO L87 Difference]: Start difference. First operand 264 states and 299 transitions. Second operand has 40 states, 40 states have (on average 2.575) internal successors, (103), 40 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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:43:20,159 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_12| Int)) (or (and (forall ((v_ArrVal_1237 (Array Int Int)) (v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1233 Int) (v_ArrVal_1242 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1233)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_1237) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_1236) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1242) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1236 (Array Int Int)) (v_ArrVal_1243 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_12| v_ArrVal_1236))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1243)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_12|) 0)))) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_69| Int)) (and (not (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_69|))) (<= |v_ULTIMATE.start_main_~x~0#1.offset_69| |c_ULTIMATE.start_main_~x~0#1.offset|))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) .cse1)) (= (select |c_#valid| .cse2) 1) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~mem15#1.offset|) (= |c_ULTIMATE.start_main_#t~mem15#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) |c_ULTIMATE.start_main_~head~0#1.base|) (= .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1)))) is different from false [2021-12-07 01:43:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:20,385 INFO L93 Difference]: Finished difference Result 383 states and 427 transitions. [2021-12-07 01:43:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-07 01:43:20,386 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.575) internal successors, (103), 40 states have internal predecessors, (103), 0 states have call successors, (0), 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:43:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:20,387 INFO L225 Difference]: With dead ends: 383 [2021-12-07 01:43:20,387 INFO L226 Difference]: Without dead ends: 383 [2021-12-07 01:43:20,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=580, Invalid=3200, Unknown=26, NotChecked=750, Total=4556 [2021-12-07 01:43:20,389 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 492 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1382 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:20,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [492 Valid, 1572 Invalid, 2614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1163 Invalid, 0 Unknown, 1382 Unchecked, 0.4s Time] [2021-12-07 01:43:20,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2021-12-07 01:43:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 277. [2021-12-07 01:43:20,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 256 states have (on average 1.2265625) internal successors, (314), 276 states have internal predecessors, (314), 0 states have call successors, (0), 0 states 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:43:20,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 314 transitions. [2021-12-07 01:43:20,393 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 314 transitions. Word has length 38 [2021-12-07 01:43:20,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:20,393 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 314 transitions. [2021-12-07 01:43:20,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.575) internal successors, (103), 40 states have internal predecessors, (103), 0 states have call successors, (0), 0 states 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:43:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 314 transitions. [2021-12-07 01:43:20,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-07 01:43:20,394 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:20,394 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] [2021-12-07 01:43:20,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-07 01:43:20,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-12-07 01:43:20,595 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:20,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:20,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1599858270, now seen corresponding path program 1 times [2021-12-07 01:43:20,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:20,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567566582] [2021-12-07 01:43:20,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:20,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:20,846 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:43:20,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:20,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567566582] [2021-12-07 01:43:20,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567566582] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:20,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320485582] [2021-12-07 01:43:20,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:20,847 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:20,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:20,847 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:20,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-07 01:43:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:20,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-07 01:43:20,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:20,931 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:43:20,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, 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:43:20,951 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:43:21,001 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-07 01:43:21,002 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:43:21,052 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-07 01:43:21,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2021-12-07 01:43:21,067 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-12-07 01:43:21,068 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-07 01:43:21,173 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:21,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 50 [2021-12-07 01:43:21,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2021-12-07 01:43:21,364 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:21,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2021-12-07 01:43:21,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:21,369 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:43:21,519 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:21,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2021-12-07 01:43:21,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:21,524 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:43:21,561 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:21,561 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 53 treesize of output 50 [2021-12-07 01:43:21,565 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 27 treesize of output 27 [2021-12-07 01:43:21,833 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 01:43:21,834 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 26 treesize of output 10 [2021-12-07 01:43:22,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-07 01:43:22,042 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:43:22,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:22,188 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1376) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (= (select |c_#valid| .cse0) 1) (and (forall ((v_ArrVal_1377 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1377) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|))))) is different from false [2021-12-07 01:43:22,261 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1376) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (= (select |c_#valid| .cse0) 1) (and (forall ((v_ArrVal_1377 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1377) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|))))) is different from false [2021-12-07 01:43:22,277 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1376) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (= (select |c_#valid| .cse0) 1) (and (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_ArrVal_1377 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1377) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))))))) is different from false [2021-12-07 01:43:22,316 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1371))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1376)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (= (select |c_#valid| .cse0) 1) (and (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1370) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1371) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1377) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|))))) is different from false [2021-12-07 01:43:22,336 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1371))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1376)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (and (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1370) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1371) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1377)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-07 01:43:22,381 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1376 (Array Int Int)) (v_ArrVal_1371 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1371))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1376)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (and (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.offset|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1370) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1371) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1377) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select |c_#valid| .cse0) 1)))) is different from false [2021-12-07 01:43:22,448 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1376 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_15| Int) (v_ArrVal_1371 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1371))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1376)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (and (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1370) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1371) |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1377) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15| 1) .cse0) 1)))) is different from false [2021-12-07 01:43:22,564 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1376 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_15| Int) (v_ArrVal_1371 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1371))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1376)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|) 0)) (= 1 (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15| 1) .cse0)) (and (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) (forall ((v_ArrVal_1377 (Array Int Int)) (v_ArrVal_1370 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| 0)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1370) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1371) |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1377) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))))))) is different from false [2021-12-07 01:43:22,586 INFO L354 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2021-12-07 01:43:22,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 110 [2021-12-07 01:43:22,598 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-07 01:43:22,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 163 treesize of output 116 [2021-12-07 01:43:22,605 INFO L354 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2021-12-07 01:43:22,605 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 382 treesize of output 328 [2021-12-07 01:43:22,618 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:22,618 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 568 treesize of output 544 [2021-12-07 01:43:22,632 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:22,633 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 544 treesize of output 518 [2021-12-07 01:43:22,643 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 518 treesize of output 502 [2021-12-07 01:43:22,656 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 75 treesize of output 67 [2021-12-07 01:43:22,661 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 67 treesize of output 59 [2021-12-07 01:43:28,725 WARN L227 SmtUtils]: Spent 6.01s on a formula simplification. DAG size of input: 18 DAG size of output: 13 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 01:43:28,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-07 01:43:28,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320485582] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:28,747 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:28,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 17] total 43 [2021-12-07 01:43:28,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366106116] [2021-12-07 01:43:28,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:28,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2021-12-07 01:43:28,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:28,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-12-07 01:43:28,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1069, Unknown=8, NotChecked=600, Total=1892 [2021-12-07 01:43:28,749 INFO L87 Difference]: Start difference. First operand 277 states and 314 transitions. Second operand has 44 states, 43 states have (on average 2.4651162790697674) internal successors, (106), 44 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:43:33,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:33,456 INFO L93 Difference]: Finished difference Result 414 states and 464 transitions. [2021-12-07 01:43:33,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-07 01:43:33,456 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.4651162790697674) internal successors, (106), 44 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 38 [2021-12-07 01:43:33,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:33,458 INFO L225 Difference]: With dead ends: 414 [2021-12-07 01:43:33,458 INFO L226 Difference]: Without dead ends: 414 [2021-12-07 01:43:33,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 62 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=601, Invalid=2497, Unknown=14, NotChecked=920, Total=4032 [2021-12-07 01:43:33,459 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 518 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 2735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1815 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:33,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 1459 Invalid, 2735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 858 Invalid, 0 Unknown, 1815 Unchecked, 0.4s Time] [2021-12-07 01:43:33,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2021-12-07 01:43:33,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 292. [2021-12-07 01:43:33,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 271 states have (on average 1.2287822878228782) internal successors, (333), 291 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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:43:33,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 333 transitions. [2021-12-07 01:43:33,464 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 333 transitions. Word has length 38 [2021-12-07 01:43:33,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:33,464 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 333 transitions. [2021-12-07 01:43:33,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.4651162790697674) internal successors, (106), 44 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:43:33,464 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 333 transitions. [2021-12-07 01:43:33,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-07 01:43:33,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:33,465 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] [2021-12-07 01:43:33,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-07 01:43:33,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-12-07 01:43:33,665 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:33,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:33,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1599858271, now seen corresponding path program 1 times [2021-12-07 01:43:33,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:33,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019335313] [2021-12-07 01:43:33,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:33,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:33,898 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:43:33,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:33,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019335313] [2021-12-07 01:43:33,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019335313] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:33,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505848498] [2021-12-07 01:43:33,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:33,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:33,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:33,900 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:33,900 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-07 01:43:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:33,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-07 01:43:33,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:33,989 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:43:34,007 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:43:34,012 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:43:34,068 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:43:34,068 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:43:34,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:34,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, 2 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:43:34,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:34,109 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 21 treesize of output 20 [2021-12-07 01:43:34,184 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:34,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 37 [2021-12-07 01:43:34,187 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 20 treesize of output 22 [2021-12-07 01:43:34,294 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-07 01:43:34,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-07 01:43:34,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-07 01:43:34,308 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:34,308 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-07 01:43:34,378 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:34,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-07 01:43:34,389 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-07 01:43:34,389 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-07 01:43:34,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 7 treesize of output 3 [2021-12-07 01:43:34,434 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:34,434 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 38 treesize of output 37 [2021-12-07 01:43:34,436 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 20 treesize of output 22 [2021-12-07 01:43:34,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:34,564 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:34,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2021-12-07 01:43:34,566 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 19 treesize of output 7 [2021-12-07 01:43:34,588 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:43:34,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:34,622 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1510 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1510) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1509 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1509) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-07 01:43:34,644 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1510 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1510) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1509 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1509) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2021-12-07 01:43:34,650 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1510 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1510) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1509 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1509) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2021-12-07 01:43:34,662 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1510 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1503))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1510)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1509 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1504) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1503) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1509) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-07 01:43:34,669 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1510 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1503))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1510)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1509 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1504) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1503) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1509)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2021-12-07 01:43:34,686 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1502 Int)) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1502)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1504) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1503) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1509) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1510 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1503))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1510)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-07 01:43:34,847 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_82| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_18| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|))) (and (forall ((v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1510 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_82| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1503))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_82|) v_ArrVal_1510)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1504 (Array Int Int)) (v_ArrVal_1503 (Array Int Int)) (v_ArrVal_1509 (Array Int Int)) (v_ArrVal_1502 Int)) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_82| v_ArrVal_1502)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1504) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_82| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1503) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_82|) v_ArrVal_1509) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_82|))) is different from false [2021-12-07 01:43:34,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:34,864 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:34,864 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 103 [2021-12-07 01:43:34,867 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:34,870 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:34,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 82 [2021-12-07 01:43:34,873 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:34,876 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:34,876 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 328 treesize of output 278 [2021-12-07 01:43:34,880 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:34,882 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:34,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 374 treesize of output 352 [2021-12-07 01:43:34,898 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 166 treesize of output 162 [2021-12-07 01:43:34,901 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 162 treesize of output 158 [2021-12-07 01:43:34,903 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 154 [2021-12-07 01:43:34,906 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:34,906 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 154 treesize of output 134 [2021-12-07 01:43:34,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 118 [2021-12-07 01:43:34,949 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:43:34,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505848498] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:34,950 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:34,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 34 [2021-12-07 01:43:34,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193717337] [2021-12-07 01:43:34,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:34,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-07 01:43:34,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:34,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-07 01:43:34,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=610, Unknown=8, NotChecked=392, Total=1122 [2021-12-07 01:43:34,951 INFO L87 Difference]: Start difference. First operand 292 states and 333 transitions. Second operand has 34 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:37,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:37,790 INFO L93 Difference]: Finished difference Result 346 states and 387 transitions. [2021-12-07 01:43:37,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-07 01:43:37,790 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-07 01:43:37,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:37,792 INFO L225 Difference]: With dead ends: 346 [2021-12-07 01:43:37,792 INFO L226 Difference]: Without dead ends: 346 [2021-12-07 01:43:37,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=322, Invalid=1589, Unknown=9, NotChecked=630, Total=2550 [2021-12-07 01:43:37,793 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 234 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1167 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:37,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 1239 Invalid, 2065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 863 Invalid, 0 Unknown, 1167 Unchecked, 0.3s Time] [2021-12-07 01:43:37,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-12-07 01:43:37,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 263. [2021-12-07 01:43:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 242 states have (on average 1.2272727272727273) internal successors, (297), 262 states have internal predecessors, (297), 0 states have call successors, (0), 0 states 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:43:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 297 transitions. [2021-12-07 01:43:37,796 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 297 transitions. Word has length 38 [2021-12-07 01:43:37,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:37,797 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 297 transitions. [2021-12-07 01:43:37,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.6176470588235294) internal successors, (89), 34 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 297 transitions. [2021-12-07 01:43:37,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-07 01:43:37,797 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:37,797 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:43:37,816 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-12-07 01:43:37,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-12-07 01:43:37,999 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:38,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:38,000 INFO L85 PathProgramCache]: Analyzing trace with hash 117734209, now seen corresponding path program 1 times [2021-12-07 01:43:38,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:38,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963224029] [2021-12-07 01:43:38,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:38,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:38,101 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:43:38,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:38,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963224029] [2021-12-07 01:43:38,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963224029] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:38,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20617609] [2021-12-07 01:43:38,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:38,102 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:38,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:38,102 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:38,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-07 01:43:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:38,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-07 01:43:38,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:38,347 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:38,347 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 15 treesize of output 7 [2021-12-07 01:43:38,350 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:38,352 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:38,352 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 15 treesize of output 10 [2021-12-07 01:43:38,372 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:43:38,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:38,545 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-07 01:43:38,545 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 24 treesize of output 23 [2021-12-07 01:43:38,551 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-12-07 01:43:38,551 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 20 treesize of output 12 [2021-12-07 01:43:38,745 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:43:38,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20617609] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:38,745 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:38,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2021-12-07 01:43:38,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898740547] [2021-12-07 01:43:38,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:38,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-07 01:43:38,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:38,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-07 01:43:38,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2021-12-07 01:43:38,747 INFO L87 Difference]: Start difference. First operand 263 states and 297 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:43:38,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:38,994 INFO L93 Difference]: Finished difference Result 297 states and 330 transitions. [2021-12-07 01:43:38,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-07 01:43:38,995 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 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:43:38,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:38,996 INFO L225 Difference]: With dead ends: 297 [2021-12-07 01:43:38,996 INFO L226 Difference]: Without dead ends: 297 [2021-12-07 01:43:38,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2021-12-07 01:43:38,996 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 132 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:38,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 810 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 437 Invalid, 0 Unknown, 198 Unchecked, 0.2s Time] [2021-12-07 01:43:38,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-12-07 01:43:38,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 282. [2021-12-07 01:43:38,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 261 states have (on average 1.2337164750957854) internal successors, (322), 281 states have internal predecessors, (322), 0 states have call successors, (0), 0 states 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:43:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 322 transitions. [2021-12-07 01:43:39,000 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 322 transitions. Word has length 39 [2021-12-07 01:43:39,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:39,000 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 322 transitions. [2021-12-07 01:43:39,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states 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:43:39,000 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 322 transitions. [2021-12-07 01:43:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-07 01:43:39,001 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:39,001 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, 1] [2021-12-07 01:43:39,020 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-12-07 01:43:39,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:39,202 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:39,203 INFO L85 PathProgramCache]: Analyzing trace with hash -645207573, now seen corresponding path program 1 times [2021-12-07 01:43:39,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:39,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497881964] [2021-12-07 01:43:39,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:39,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:39,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:39,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:39,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497881964] [2021-12-07 01:43:39,280 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497881964] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:39,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659387674] [2021-12-07 01:43:39,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:39,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:39,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:39,282 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:39,283 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-07 01:43:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:39,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-07 01:43:39,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:39,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 15 treesize of output 5 [2021-12-07 01:43:39,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:39,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:39,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:43:39,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659387674] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:39,563 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:39,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-07 01:43:39,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860905343] [2021-12-07 01:43:39,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:39,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:43:39,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:39,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:43:39,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:43:39,564 INFO L87 Difference]: Start difference. First operand 282 states and 322 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:39,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:39,679 INFO L93 Difference]: Finished difference Result 291 states and 330 transitions. [2021-12-07 01:43:39,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:43:39,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-07 01:43:39,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:39,680 INFO L225 Difference]: With dead ends: 291 [2021-12-07 01:43:39,680 INFO L226 Difference]: Without dead ends: 268 [2021-12-07 01:43:39,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:43:39,681 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 35 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:39,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 291 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 192 Invalid, 0 Unknown, 54 Unchecked, 0.1s Time] [2021-12-07 01:43:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-12-07 01:43:39,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 265. [2021-12-07 01:43:39,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 244 states have (on average 1.2418032786885247) internal successors, (303), 264 states have internal predecessors, (303), 0 states have call successors, (0), 0 states 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:43:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 303 transitions. [2021-12-07 01:43:39,685 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 303 transitions. Word has length 40 [2021-12-07 01:43:39,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:39,685 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 303 transitions. [2021-12-07 01:43:39,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:39,685 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 303 transitions. [2021-12-07 01:43:39,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-07 01:43:39,685 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:39,685 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, 1] [2021-12-07 01:43:39,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-07 01:43:39,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2021-12-07 01:43:39,887 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:39,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:39,887 INFO L85 PathProgramCache]: Analyzing trace with hash -907498302, now seen corresponding path program 1 times [2021-12-07 01:43:39,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:39,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463901533] [2021-12-07 01:43:39,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:39,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:40,051 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:43:40,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:40,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463901533] [2021-12-07 01:43:40,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463901533] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:40,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685878373] [2021-12-07 01:43:40,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:40,052 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:40,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:40,053 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:40,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-07 01:43:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:40,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-07 01:43:40,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:40,139 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:43:40,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:40,151 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:43:40,173 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:40,174 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 17 treesize of output 17 [2021-12-07 01:43:40,234 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:43:40,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:43:40,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685878373] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:40,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:43:40,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2021-12-07 01:43:40,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207446913] [2021-12-07 01:43:40,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:40,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:43:40,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:40,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:43:40,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-12-07 01:43:40,235 INFO L87 Difference]: Start difference. First operand 265 states and 303 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 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:43:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:40,386 INFO L93 Difference]: Finished difference Result 288 states and 326 transitions. [2021-12-07 01:43:40,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:43:40,386 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 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 40 [2021-12-07 01:43:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:40,387 INFO L225 Difference]: With dead ends: 288 [2021-12-07 01:43:40,387 INFO L226 Difference]: Without dead ends: 272 [2021-12-07 01:43:40,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2021-12-07 01:43:40,388 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 143 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:40,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 413 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-12-07 01:43:40,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 268. [2021-12-07 01:43:40,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 247 states have (on average 1.2388663967611335) internal successors, (306), 267 states have internal predecessors, (306), 0 states have call successors, (0), 0 states 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:43:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 306 transitions. [2021-12-07 01:43:40,391 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 306 transitions. Word has length 40 [2021-12-07 01:43:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:40,391 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 306 transitions. [2021-12-07 01:43:40,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 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:43:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 306 transitions. [2021-12-07 01:43:40,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-07 01:43:40,392 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:40,392 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:43:40,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2021-12-07 01:43:40,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:40,594 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:40,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:40,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1766771785, now seen corresponding path program 1 times [2021-12-07 01:43:40,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:40,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231817249] [2021-12-07 01:43:40,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:40,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:40,866 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:43:40,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:40,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231817249] [2021-12-07 01:43:40,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231817249] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:40,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790775185] [2021-12-07 01:43:40,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:40,867 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:40,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:40,867 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:40,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-07 01:43:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:40,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-07 01:43:40,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:40,957 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:43:40,972 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:43:40,976 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:43:41,010 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:43:41,011 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:43:41,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:41,043 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:43:41,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:41,047 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 21 treesize of output 20 [2021-12-07 01:43:41,124 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:41,125 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 38 treesize of output 37 [2021-12-07 01:43:41,127 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 27 treesize of output 27 [2021-12-07 01:43:41,223 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:41,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-07 01:43:41,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:41,227 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:43:41,275 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:41,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-07 01:43:41,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:41,283 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:43:41,303 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:41,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-07 01:43:41,306 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 27 treesize of output 27 [2021-12-07 01:43:41,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:41,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2021-12-07 01:43:41,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:41,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2021-12-07 01:43:41,470 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:43:41,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:41,530 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1810 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1810) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1809 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1809) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-07 01:43:41,548 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1810 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1810) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1809 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1809) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-07 01:43:41,553 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1810 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1810) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1809 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1809) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-07 01:43:41,563 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1810 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1803))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1810)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1809 (Array Int Int)) (v_ArrVal_1804 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1804) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1803) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1809) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2021-12-07 01:43:41,570 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1809 (Array Int Int)) (v_ArrVal_1804 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1804) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1803) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1809)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1810 (Array Int Int)) (v_ArrVal_1803 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1803))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1810)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-07 01:43:41,913 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:41,921 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:41,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 103 [2021-12-07 01:43:41,924 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:41,928 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:41,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 82 [2021-12-07 01:43:41,932 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:41,936 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:41,936 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 328 treesize of output 278 [2021-12-07 01:43:41,942 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:41,945 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:41,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 518 treesize of output 484 [2021-12-07 01:43:41,961 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 252 treesize of output 244 [2021-12-07 01:43:41,966 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 244 treesize of output 228 [2021-12-07 01:43:41,969 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 228 treesize of output 216 [2021-12-07 01:43:41,973 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:41,973 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 216 treesize of output 196 [2021-12-07 01:43:41,977 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 196 treesize of output 180 [2021-12-07 01:43:42,044 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:43:42,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790775185] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:42,045 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:42,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 34 [2021-12-07 01:43:42,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351616216] [2021-12-07 01:43:42,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:42,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-07 01:43:42,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:42,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-07 01:43:42,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=684, Unknown=14, NotChecked=290, Total=1122 [2021-12-07 01:43:42,046 INFO L87 Difference]: Start difference. First operand 268 states and 306 transitions. Second operand has 34 states, 34 states have (on average 3.088235294117647) internal successors, (105), 34 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:42,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:42,785 INFO L93 Difference]: Finished difference Result 319 states and 357 transitions. [2021-12-07 01:43:42,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-07 01:43:42,786 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.088235294117647) internal successors, (105), 34 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-07 01:43:42,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:42,787 INFO L225 Difference]: With dead ends: 319 [2021-12-07 01:43:42,787 INFO L226 Difference]: Without dead ends: 319 [2021-12-07 01:43:42,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=310, Invalid=1256, Unknown=14, NotChecked=400, Total=1980 [2021-12-07 01:43:42,788 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 239 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 1879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1076 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:42,788 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 1109 Invalid, 1879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 768 Invalid, 0 Unknown, 1076 Unchecked, 0.3s Time] [2021-12-07 01:43:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-12-07 01:43:42,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 275. [2021-12-07 01:43:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 254 states have (on average 1.2401574803149606) internal successors, (315), 274 states have internal predecessors, (315), 0 states have call successors, (0), 0 states 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:43:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 315 transitions. [2021-12-07 01:43:42,791 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 315 transitions. Word has length 40 [2021-12-07 01:43:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:42,792 INFO L470 AbstractCegarLoop]: Abstraction has 275 states and 315 transitions. [2021-12-07 01:43:42,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.088235294117647) internal successors, (105), 34 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:43:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 315 transitions. [2021-12-07 01:43:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-07 01:43:42,792 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:42,792 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:43:42,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-07 01:43:42,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-12-07 01:43:42,994 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:42,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:42,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1293820847, now seen corresponding path program 1 times [2021-12-07 01:43:42,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:42,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634535891] [2021-12-07 01:43:42,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:42,996 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:43,252 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:43:43,252 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:43,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634535891] [2021-12-07 01:43:43,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634535891] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:43,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385058969] [2021-12-07 01:43:43,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:43,253 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:43,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:43,253 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:43,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-07 01:43:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:43,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-07 01:43:43,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:43,343 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:43:43,360 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:43:43,363 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:43:43,396 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:43:43,396 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:43:43,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:43,406 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:43:43,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:43,413 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 21 treesize of output 20 [2021-12-07 01:43:43,461 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:43,461 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 38 treesize of output 37 [2021-12-07 01:43:43,465 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 20 treesize of output 22 [2021-12-07 01:43:43,553 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:43,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-07 01:43:43,566 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-07 01:43:43,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-07 01:43:43,568 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 7 treesize of output 3 [2021-12-07 01:43:43,636 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:43,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-07 01:43:43,647 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-07 01:43:43,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-07 01:43:43,650 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 7 treesize of output 3 [2021-12-07 01:43:43,683 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:43,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 38 treesize of output 37 [2021-12-07 01:43:43,686 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 20 treesize of output 22 [2021-12-07 01:43:43,825 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 19 treesize of output 7 [2021-12-07 01:43:43,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:43,829 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:43,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2021-12-07 01:43:43,834 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:43:43,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:43,896 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1943 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1943) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1942 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1942) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-07 01:43:43,916 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1942 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1942) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1943 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1943) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-07 01:43:43,922 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1943 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1943) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1942 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1942) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2021-12-07 01:43:43,932 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1936 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1937) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1936) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1942) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1943 (Array Int Int)) (v_ArrVal_1936 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1936))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1943)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-07 01:43:43,938 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1936 (Array Int Int))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1937) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1936) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1942)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1943 (Array Int Int)) (v_ArrVal_1936 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1936))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1943)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-07 01:43:43,953 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1943 (Array Int Int)) (v_ArrVal_1936 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1936))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1943)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1935 Int) (v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1936 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1935)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1937) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1936) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1942) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))))) is different from false [2021-12-07 01:43:44,096 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_105| Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_26| Int)) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_105|) (and (forall ((v_ArrVal_1935 Int) (v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1936 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_105| v_ArrVal_1935)) |v_ULTIMATE.start_main_#t~malloc7#1.base_26| v_ArrVal_1937) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_105| |v_ULTIMATE.start_main_#t~malloc7#1.base_26|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_26| v_ArrVal_1936) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_105|) v_ArrVal_1942) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (forall ((v_ArrVal_1943 (Array Int Int)) (v_ArrVal_1936 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_105| |v_ULTIMATE.start_main_#t~malloc7#1.base_26|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_26| v_ArrVal_1936))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_105|) v_ArrVal_1943)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) |c_ULTIMATE.start_main_~head~0#1.base|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_26|) 0)))) is different from false [2021-12-07 01:43:44,105 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:44,110 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:44,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 103 [2021-12-07 01:43:44,113 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:44,116 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:44,116 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 82 [2021-12-07 01:43:44,119 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:44,121 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:44,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 220 treesize of output 184 [2021-12-07 01:43:44,125 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:44,128 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:44,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 280 treesize of output 258 [2021-12-07 01:43:44,136 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 70 treesize of output 66 [2021-12-07 01:43:44,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:44,139 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 66 treesize of output 58 [2021-12-07 01:43:44,141 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 58 treesize of output 54 [2021-12-07 01:43:44,143 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 54 treesize of output 50 [2021-12-07 01:43:44,145 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 46 [2021-12-07 01:43:44,174 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:43:44,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385058969] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:44,174 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:44,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15] total 31 [2021-12-07 01:43:44,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845529648] [2021-12-07 01:43:44,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:44,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-07 01:43:44,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:44,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-07 01:43:44,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=461, Unknown=9, NotChecked=350, Total=930 [2021-12-07 01:43:44,175 INFO L87 Difference]: Start difference. First operand 275 states and 315 transitions. Second operand has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:43:48,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:48,795 INFO L93 Difference]: Finished difference Result 307 states and 345 transitions. [2021-12-07 01:43:48,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-07 01:43:48,796 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 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:43:48,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:48,797 INFO L225 Difference]: With dead ends: 307 [2021-12-07 01:43:48,797 INFO L226 Difference]: Without dead ends: 307 [2021-12-07 01:43:48,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 64 SyntacticMatches, 10 SemanticMatches, 39 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=239, Invalid=900, Unknown=11, NotChecked=490, Total=1640 [2021-12-07 01:43:48,798 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 297 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1018 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:48,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 1061 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 683 Invalid, 0 Unknown, 1018 Unchecked, 0.3s Time] [2021-12-07 01:43:48,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-12-07 01:43:48,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 268. [2021-12-07 01:43:48,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 247 states have (on average 1.2388663967611335) internal successors, (306), 267 states have internal predecessors, (306), 0 states have call successors, (0), 0 states 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:43:48,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 306 transitions. [2021-12-07 01:43:48,801 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 306 transitions. Word has length 40 [2021-12-07 01:43:48,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:48,801 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 306 transitions. [2021-12-07 01:43:48,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.193548387096774) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states 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:43:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 306 transitions. [2021-12-07 01:43:48,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-07 01:43:48,802 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:48,802 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, 1] [2021-12-07 01:43:48,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-12-07 01:43:49,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-12-07 01:43:49,003 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:49,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:49,004 INFO L85 PathProgramCache]: Analyzing trace with hash -484004678, now seen corresponding path program 1 times [2021-12-07 01:43:49,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:49,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915886109] [2021-12-07 01:43:49,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:49,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:49,077 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:43:49,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:49,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915886109] [2021-12-07 01:43:49,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915886109] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:49,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587171603] [2021-12-07 01:43:49,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:49,077 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:49,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:49,078 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:49,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-07 01:43:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:49,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-07 01:43:49,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:49,169 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:43:49,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:43:49,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 23 treesize of output 22 [2021-12-07 01:43:49,201 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:49,202 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 17 treesize of output 17 [2021-12-07 01:43:49,262 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:43:49,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:43:49,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587171603] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:49,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-07 01:43:49,262 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2021-12-07 01:43:49,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525935913] [2021-12-07 01:43:49,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:49,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:43:49,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:49,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:43:49,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2021-12-07 01:43:49,263 INFO L87 Difference]: Start difference. First operand 268 states and 306 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 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:43:49,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:49,398 INFO L93 Difference]: Finished difference Result 262 states and 299 transitions. [2021-12-07 01:43:49,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:43:49,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 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 40 [2021-12-07 01:43:49,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:49,399 INFO L225 Difference]: With dead ends: 262 [2021-12-07 01:43:49,399 INFO L226 Difference]: Without dead ends: 246 [2021-12-07 01:43:49,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2021-12-07 01:43:49,400 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 155 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:49,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 350 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-07 01:43:49,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-12-07 01:43:49,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 239. [2021-12-07 01:43:49,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 218 states have (on average 1.2660550458715596) internal successors, (276), 238 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:43:49,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 276 transitions. [2021-12-07 01:43:49,404 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 276 transitions. Word has length 40 [2021-12-07 01:43:49,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:49,404 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 276 transitions. [2021-12-07 01:43:49,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 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:43:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 276 transitions. [2021-12-07 01:43:49,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-07 01:43:49,405 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:49,405 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, 1, 1, 1] [2021-12-07 01:43:49,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-07 01:43:49,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-12-07 01:43:49,607 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:49,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:49,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1739978080, now seen corresponding path program 1 times [2021-12-07 01:43:49,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:49,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559932689] [2021-12-07 01:43:49,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:49,609 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:49,735 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:43:49,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:49,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559932689] [2021-12-07 01:43:49,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559932689] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:43:49,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:43:49,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 01:43:49,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964533885] [2021-12-07 01:43:49,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:43:49,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:43:49,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:49,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:43:49,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:43:49,736 INFO L87 Difference]: Start difference. First operand 239 states and 276 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 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:43:49,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:43:49,967 INFO L93 Difference]: Finished difference Result 254 states and 288 transitions. [2021-12-07 01:43:49,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-07 01:43:49,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 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:43:49,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:43:49,968 INFO L225 Difference]: With dead ends: 254 [2021-12-07 01:43:49,969 INFO L226 Difference]: Without dead ends: 249 [2021-12-07 01:43:49,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2021-12-07 01:43:49,969 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 189 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:49,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 356 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:43:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2021-12-07 01:43:49,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 221. [2021-12-07 01:43:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 200 states have (on average 1.275) internal successors, (255), 220 states have internal predecessors, (255), 0 states have call successors, (0), 0 states 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:43:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 255 transitions. [2021-12-07 01:43:49,972 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 255 transitions. Word has length 42 [2021-12-07 01:43:49,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:43:49,972 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 255 transitions. [2021-12-07 01:43:49,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 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:43:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 255 transitions. [2021-12-07 01:43:49,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-07 01:43:49,972 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:43:49,972 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:43:49,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-07 01:43:49,973 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:43:49,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:43:49,973 INFO L85 PathProgramCache]: Analyzing trace with hash 25746790, now seen corresponding path program 1 times [2021-12-07 01:43:49,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:43:49,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391336368] [2021-12-07 01:43:49,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:49,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:43:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:50,199 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:43:50,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:43:50,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391336368] [2021-12-07 01:43:50,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391336368] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-07 01:43:50,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288962722] [2021-12-07 01:43:50,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:43:50,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:50,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:50,200 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-07 01:43:50,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-07 01:43:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:43:50,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-07 01:43:50,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:43:50,307 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:43:50,329 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-07 01:43:50,329 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:43:50,350 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:43:50,387 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:50,387 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:43:50,437 INFO L354 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2021-12-07 01:43:50,438 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:43:50,477 INFO L354 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2021-12-07 01:43:50,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2021-12-07 01:43:50,620 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:50,620 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 48 [2021-12-07 01:43:50,927 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:50,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 48 [2021-12-07 01:43:51,217 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:51,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 48 [2021-12-07 01:43:51,284 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:43:51,284 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 51 treesize of output 48 [2021-12-07 01:43:52,043 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:52,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2021-12-07 01:43:52,163 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:43:52,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:43:52,215 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2177 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2021-12-07 01:43:52,220 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2177 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2021-12-07 01:43:52,226 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_2174))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2177)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2021-12-07 01:43:52,231 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2174))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2177)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2021-12-07 01:43:52,238 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2174 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_2174))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2177)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2021-12-07 01:43:52,247 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_2177 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_29| Int) (v_ArrVal_2174 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|) 0)) (= 1 (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_2174))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2177)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))))) is different from false [2021-12-07 01:43:52,263 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_2177 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_29| Int) (v_ArrVal_2174 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_2174))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2177)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|) 0)))) is different from false [2021-12-07 01:43:52,279 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2170 (Array Int Int)) (|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_2177 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_29| Int) (v_ArrVal_2174 (Array Int Int))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29| 1) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_2170))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_29| v_ArrVal_2174))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_2177)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_29|) 0)))) is different from false [2021-12-07 01:43:52,327 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:43:52,327 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 95 treesize of output 66 [2021-12-07 01:43:52,329 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:43:52,330 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 96 treesize of output 92 [2021-12-07 01:43:52,334 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 61 treesize of output 53 [2021-12-07 01:43:52,338 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 51 treesize of output 47 [2021-12-07 01:43:52,341 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 82 treesize of output 74 [2021-12-07 01:43:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-07 01:43:52,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288962722] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:43:52,486 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-07 01:43:52,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 16] total 39 [2021-12-07 01:43:52,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933324840] [2021-12-07 01:43:52,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-07 01:43:52,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-07 01:43:52,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:43:52,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-07 01:43:52,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=831, Unknown=11, NotChecked=536, Total=1560 [2021-12-07 01:43:52,488 INFO L87 Difference]: Start difference. First operand 221 states and 255 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:43:57,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 101 [2021-12-07 01:43:57,075 WARN L228 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-12-07 01:43:57,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-07 01:43:57,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=265, Invalid=1237, Unknown=12, NotChecked=648, Total=2162 [2021-12-07 01:43:57,077 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 49 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 318 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:43:57,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 150 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 189 Invalid, 0 Unknown, 318 Unchecked, 0.1s Time] [2021-12-07 01:43:57,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-12-07 01:43:57,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-07 01:43:57,280 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:241) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:260) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:159) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:237) ... 56 more [2021-12-07 01:43:57,289 INFO L158 Benchmark]: Toolchain (without parser) took 59951.36ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 92.7MB in the beginning and 74.8MB in the end (delta: 17.9MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2021-12-07 01:43:57,289 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 77.6MB. Free memory was 56.5MB in the beginning and 56.5MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 01:43:57,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.25ms. Allocated memory is still 127.9MB. Free memory was 92.4MB in the beginning and 96.5MB in the end (delta: -4.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-07 01:43:57,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.76ms. Allocated memory is still 127.9MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 01:43:57,290 INFO L158 Benchmark]: Boogie Preprocessor took 24.17ms. Allocated memory is still 127.9MB. Free memory was 94.4MB in the beginning and 93.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 01:43:57,290 INFO L158 Benchmark]: RCFGBuilder took 431.42ms. Allocated memory is still 127.9MB. Free memory was 92.3MB in the beginning and 71.1MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-07 01:43:57,290 INFO L158 Benchmark]: TraceAbstraction took 59161.75ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 70.4MB in the beginning and 74.8MB in the end (delta: -4.4MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2021-12-07 01:43:57,291 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 77.6MB. Free memory was 56.5MB in the beginning and 56.5MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 295.25ms. Allocated memory is still 127.9MB. Free memory was 92.4MB in the beginning and 96.5MB in the end (delta: -4.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.76ms. Allocated memory is still 127.9MB. Free memory was 96.5MB in the beginning and 94.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.17ms. Allocated memory is still 127.9MB. Free memory was 94.4MB in the beginning and 93.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 431.42ms. Allocated memory is still 127.9MB. Free memory was 92.3MB in the beginning and 71.1MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 59161.75ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 70.4MB in the beginning and 74.8MB in the end (delta: -4.4MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:241) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/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_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-optional-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/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 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 01:43:58,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 01:43:58,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 01:43:58,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 01:43:58,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 01:43:58,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 01:43:58,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 01:43:58,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 01:43:58,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 01:43:58,638 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 01:43:58,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 01:43:58,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 01:43:58,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 01:43:58,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 01:43:58,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 01:43:58,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 01:43:58,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 01:43:58,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 01:43:58,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 01:43:58,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 01:43:58,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 01:43:58,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 01:43:58,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 01:43:58,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 01:43:58,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 01:43:58,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 01:43:58,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 01:43:58,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 01:43:58,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 01:43:58,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 01:43:58,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 01:43:58,659 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 01:43:58,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 01:43:58,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 01:43:58,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 01:43:58,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 01:43:58,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 01:43:58,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 01:43:58,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 01:43:58,676 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 01:43:58,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 01:43:58,677 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-07 01:43:58,695 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 01:43:58,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 01:43:58,696 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 01:43:58,696 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 01:43:58,696 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 01:43:58,696 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 01:43:58,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 01:43:58,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 01:43:58,697 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 01:43:58,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 01:43:58,698 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 01:43:58,698 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-07 01:43:58,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 01:43:58,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 01:43:58,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 01:43:58,698 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-07 01:43:58,698 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-07 01:43:58,699 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-07 01:43:58,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 01:43:58,699 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-07 01:43:58,699 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-07 01:43:58,699 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-07 01:43:58,699 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 01:43:58,699 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 01:43:58,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 01:43:58,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 01:43:58,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 01:43:58,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:43:58,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 01:43:58,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 01:43:58,700 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-07 01:43:58,701 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-07 01:43:58,701 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 01:43:58,701 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-07 01:43:58,701 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_5256e11a-e4f2-4c03-934f-293c43069cf5/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_5256e11a-e4f2-4c03-934f-293c43069cf5/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 -> 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 [2021-12-07 01:43:58,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 01:43:58,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 01:43:58,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 01:43:58,934 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 01:43:58,935 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 01:43:58,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/forester-heap/dll-optional-1.i [2021-12-07 01:43:58,979 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/data/50eba8934/0107340cb29d466f9f31b1a240578add/FLAG61daa571a [2021-12-07 01:43:59,398 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 01:43:59,399 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/sv-benchmarks/c/forester-heap/dll-optional-1.i [2021-12-07 01:43:59,408 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/data/50eba8934/0107340cb29d466f9f31b1a240578add/FLAG61daa571a [2021-12-07 01:43:59,417 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/data/50eba8934/0107340cb29d466f9f31b1a240578add [2021-12-07 01:43:59,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 01:43:59,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 01:43:59,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 01:43:59,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 01:43:59,424 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 01:43:59,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:43:59" (1/1) ... [2021-12-07 01:43:59,425 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5059e52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:59, skipping insertion in model container [2021-12-07 01:43:59,425 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:43:59" (1/1) ... [2021-12-07 01:43:59,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 01:43:59,461 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 01:43:59,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/sv-benchmarks/c/forester-heap/dll-optional-1.i[22753,22766] [2021-12-07 01:43:59,692 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:43:59,704 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 01:43:59,746 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/sv-benchmarks/c/forester-heap/dll-optional-1.i[22753,22766] [2021-12-07 01:43:59,749 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:43:59,781 INFO L208 MainTranslator]: Completed translation [2021-12-07 01:43:59,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:59 WrapperNode [2021-12-07 01:43:59,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 01:43:59,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 01:43:59,783 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 01:43:59,783 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 01:43:59,790 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:43:59" (1/1) ... [2021-12-07 01:43:59,803 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:43:59" (1/1) ... [2021-12-07 01:43:59,822 INFO L137 Inliner]: procedures = 122, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 136 [2021-12-07 01:43:59,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 01:43:59,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 01:43:59,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 01:43:59,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 01:43:59,829 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:59" (1/1) ... [2021-12-07 01:43:59,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:59" (1/1) ... [2021-12-07 01:43:59,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:59" (1/1) ... [2021-12-07 01:43:59,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:59" (1/1) ... [2021-12-07 01:43:59,842 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:59" (1/1) ... [2021-12-07 01:43:59,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:59" (1/1) ... [2021-12-07 01:43:59,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:59" (1/1) ... [2021-12-07 01:43:59,850 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 01:43:59,851 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 01:43:59,851 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 01:43:59,851 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 01:43:59,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:59" (1/1) ... [2021-12-07 01:43:59,857 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:43:59,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:43:59,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 01:43:59,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 01:43:59,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-07 01:43:59,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-07 01:43:59,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 01:43:59,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-07 01:43:59,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-07 01:43:59,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-07 01:43:59,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-07 01:43:59,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-07 01:43:59,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 01:43:59,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 01:43:59,985 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 01:43:59,986 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 01:44:00,504 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 01:44:00,509 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 01:44:00,509 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-07 01:44:00,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:44:00 BoogieIcfgContainer [2021-12-07 01:44:00,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 01:44:00,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 01:44:00,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 01:44:00,514 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 01:44:00,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:43:59" (1/3) ... [2021-12-07 01:44:00,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b57c64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:44:00, skipping insertion in model container [2021-12-07 01:44:00,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:43:59" (2/3) ... [2021-12-07 01:44:00,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b57c64e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:44:00, skipping insertion in model container [2021-12-07 01:44:00,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:44:00" (3/3) ... [2021-12-07 01:44:00,516 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2021-12-07 01:44:00,520 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 01:44:00,520 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2021-12-07 01:44:00,551 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 01:44:00,556 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:44:00,556 INFO L340 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2021-12-07 01:44:00,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 77 states have (on average 2.155844155844156) internal successors, (166), 149 states have internal predecessors, (166), 0 states have call successors, (0), 0 states 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:44:00,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-07 01:44:00,572 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:00,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-07 01:44:00,573 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:00,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:00,576 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-07 01:44:00,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:00,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215116662] [2021-12-07 01:44:00,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:00,585 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:00,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:00,586 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:00,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-07 01:44:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:00,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 01:44:00,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:00,714 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:44:00,722 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:44:00,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:00,723 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:00,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215116662] [2021-12-07 01:44:00,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215116662] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:00,724 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:00,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:44:00,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039823909] [2021-12-07 01:44:00,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:00,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:44:00,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:00,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:44:00,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:44:00,758 INFO L87 Difference]: Start difference. First operand has 150 states, 77 states have (on average 2.155844155844156) internal successors, (166), 149 states have internal predecessors, (166), 0 states have call successors, (0), 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:44:01,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:01,031 INFO L93 Difference]: Finished difference Result 151 states and 161 transitions. [2021-12-07 01:44:01,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:44:01,033 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:44:01,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:01,040 INFO L225 Difference]: With dead ends: 151 [2021-12-07 01:44:01,040 INFO L226 Difference]: Without dead ends: 147 [2021-12-07 01:44:01,041 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:44:01,044 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 134 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:01,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 84 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:44:01,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-12-07 01:44:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 141. [2021-12-07 01:44:01,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 79 states have (on average 1.9367088607594938) internal successors, (153), 140 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 153 transitions. [2021-12-07 01:44:01,075 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 153 transitions. Word has length 3 [2021-12-07 01:44:01,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:01,076 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 153 transitions. [2021-12-07 01:44:01,076 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:44:01,076 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2021-12-07 01:44:01,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-07 01:44:01,076 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:01,076 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-07 01:44:01,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-07 01:44:01,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:01,278 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:01,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:01,280 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-07 01:44:01,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:01,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938659373] [2021-12-07 01:44:01,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:01,283 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:01,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:01,285 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:01,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-07 01:44:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:01,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-07 01:44:01,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:01,448 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:44:01,460 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:44:01,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:01,461 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:01,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938659373] [2021-12-07 01:44:01,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938659373] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:01,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:01,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:44:01,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391718381] [2021-12-07 01:44:01,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:01,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:44:01,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:01,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:44:01,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:44:01,464 INFO L87 Difference]: Start difference. First operand 141 states and 153 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:44:01,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:01,720 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2021-12-07 01:44:01,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:44:01,720 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:44:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:01,722 INFO L225 Difference]: With dead ends: 136 [2021-12-07 01:44:01,722 INFO L226 Difference]: Without dead ends: 136 [2021-12-07 01:44:01,722 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:44:01,723 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 110 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:01,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 97 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 01:44:01,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-12-07 01:44:01,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2021-12-07 01:44:01,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 79 states have (on average 1.8227848101265822) internal successors, (144), 131 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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:44:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2021-12-07 01:44:01,732 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 3 [2021-12-07 01:44:01,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:01,732 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2021-12-07 01:44:01,732 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:44:01,732 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2021-12-07 01:44:01,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-07 01:44:01,733 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:01,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:44:01,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-07 01:44:01,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:01,935 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:01,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:01,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2006091119, now seen corresponding path program 1 times [2021-12-07 01:44:01,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:01,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894296845] [2021-12-07 01:44:01,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:01,941 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:01,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:01,944 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:01,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-07 01:44:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:02,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-07 01:44:02,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:02,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-07 01:44:02,079 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:44:02,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2021-12-07 01:44:02,114 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:44:02,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:02,114 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:02,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894296845] [2021-12-07 01:44:02,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894296845] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:02,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:02,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:44:02,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973442911] [2021-12-07 01:44:02,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:02,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:44:02,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:02,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:44:02,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:44:02,116 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:02,599 INFO L93 Difference]: Finished difference Result 175 states and 192 transitions. [2021-12-07 01:44:02,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:44:02,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-07 01:44:02,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:02,600 INFO L225 Difference]: With dead ends: 175 [2021-12-07 01:44:02,601 INFO L226 Difference]: Without dead ends: 175 [2021-12-07 01:44:02,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 1 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:44:02,602 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 50 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:02,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 318 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:44:02,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-07 01:44:02,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 131. [2021-12-07 01:44:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 79 states have (on average 1.8101265822784811) internal successors, (143), 130 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:02,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2021-12-07 01:44:02,610 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 11 [2021-12-07 01:44:02,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:02,610 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2021-12-07 01:44:02,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:02,611 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2021-12-07 01:44:02,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-07 01:44:02,611 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:02,611 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:44:02,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-07 01:44:02,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:02,813 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:02,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:02,815 INFO L85 PathProgramCache]: Analyzing trace with hash 2006091120, now seen corresponding path program 1 times [2021-12-07 01:44:02,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:02,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001952290] [2021-12-07 01:44:02,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:02,818 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:02,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:02,821 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:02,823 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-07 01:44:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:02,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-07 01:44:02,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:02,920 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:44:02,946 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:44:02,953 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:44:02,997 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 21 treesize of output 9 [2021-12-07 01:44:03,002 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 19 treesize of output 7 [2021-12-07 01:44:03,014 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:44:03,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:03,015 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:03,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001952290] [2021-12-07 01:44:03,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001952290] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:03,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:03,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:44:03,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14668440] [2021-12-07 01:44:03,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:03,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:44:03,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:03,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:44:03,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:44:03,017 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:03,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:03,527 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2021-12-07 01:44:03,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:44:03,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-07 01:44:03,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:03,528 INFO L225 Difference]: With dead ends: 130 [2021-12-07 01:44:03,528 INFO L226 Difference]: Without dead ends: 130 [2021-12-07 01:44:03,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:44:03,530 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 2 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:03,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 354 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-07 01:44:03,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-07 01:44:03,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-12-07 01:44:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 79 states have (on average 1.7974683544303798) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:03,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2021-12-07 01:44:03,536 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 11 [2021-12-07 01:44:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:03,536 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2021-12-07 01:44:03,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2021-12-07 01:44:03,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-07 01:44:03,537 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:03,537 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:44:03,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-07 01:44:03,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:03,739 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:03,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:03,740 INFO L85 PathProgramCache]: Analyzing trace with hash 710692029, now seen corresponding path program 1 times [2021-12-07 01:44:03,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:03,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077409566] [2021-12-07 01:44:03,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:03,743 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:03,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:03,744 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:03,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-07 01:44:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:03,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-07 01:44:03,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:03,814 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:44:03,852 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-07 01:44:03,853 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 23 [2021-12-07 01:44:03,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:44:03,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:03,870 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:03,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077409566] [2021-12-07 01:44:03,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077409566] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:03,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:03,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:44:03,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732771292] [2021-12-07 01:44:03,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:03,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:44:03,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:03,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:44:03,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:44:03,871 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:04,189 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2021-12-07 01:44:04,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:44:04,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-07 01:44:04,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:04,190 INFO L225 Difference]: With dead ends: 131 [2021-12-07 01:44:04,190 INFO L226 Difference]: Without dead ends: 131 [2021-12-07 01:44:04,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 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:44:04,191 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 180 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:04,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 71 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:44:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-07 01:44:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2021-12-07 01:44:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 85 states have (on average 1.6352941176470588) internal successors, (139), 121 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2021-12-07 01:44:04,196 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 11 [2021-12-07 01:44:04,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:04,196 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2021-12-07 01:44:04,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:04,197 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2021-12-07 01:44:04,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-07 01:44:04,197 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:04,197 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:44:04,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-07 01:44:04,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:04,398 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:04,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:04,400 INFO L85 PathProgramCache]: Analyzing trace with hash 710692030, now seen corresponding path program 1 times [2021-12-07 01:44:04,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:04,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156503066] [2021-12-07 01:44:04,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:04,402 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:04,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:04,405 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:04,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-07 01:44:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:04,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-07 01:44:04,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:04,529 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:44:04,585 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:04,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-07 01:44:04,595 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:44:04,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:04,596 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:04,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156503066] [2021-12-07 01:44:04,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156503066] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:04,596 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:04,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:44:04,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946332477] [2021-12-07 01:44:04,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:04,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:44:04,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:04,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:44:04,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:44:04,597 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:05,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:05,025 INFO L93 Difference]: Finished difference Result 178 states and 197 transitions. [2021-12-07 01:44:05,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:44:05,026 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-07 01:44:05,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:05,027 INFO L225 Difference]: With dead ends: 178 [2021-12-07 01:44:05,027 INFO L226 Difference]: Without dead ends: 178 [2021-12-07 01:44:05,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 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:44:05,028 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 184 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:05,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 112 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:44:05,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-07 01:44:05,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 152. [2021-12-07 01:44:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 115 states have (on average 1.5565217391304347) internal successors, (179), 151 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:44:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 179 transitions. [2021-12-07 01:44:05,033 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 179 transitions. Word has length 11 [2021-12-07 01:44:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:05,033 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 179 transitions. [2021-12-07 01:44:05,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:05,034 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 179 transitions. [2021-12-07 01:44:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-07 01:44:05,034 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:05,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:44:05,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-07 01:44:05,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:05,236 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:05,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:05,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1962503516, now seen corresponding path program 1 times [2021-12-07 01:44:05,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:05,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703827163] [2021-12-07 01:44:05,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:05,240 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:05,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:05,241 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:05,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-07 01:44:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:05,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-07 01:44:05,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:05,307 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:44:05,316 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:44:05,334 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 26 treesize of output 18 [2021-12-07 01:44:05,340 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:44:05,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:05,340 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:05,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703827163] [2021-12-07 01:44:05,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703827163] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:05,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:05,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:44:05,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691906794] [2021-12-07 01:44:05,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:05,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:44:05,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:05,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:44:05,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:44:05,342 INFO L87 Difference]: Start difference. First operand 152 states and 179 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:05,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:05,733 INFO L93 Difference]: Finished difference Result 151 states and 177 transitions. [2021-12-07 01:44:05,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:44:05,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-07 01:44:05,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:05,734 INFO L225 Difference]: With dead ends: 151 [2021-12-07 01:44:05,734 INFO L226 Difference]: Without dead ends: 151 [2021-12-07 01:44:05,735 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 1 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:44:05,735 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 9 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:05,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 296 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:44:05,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-12-07 01:44:05,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2021-12-07 01:44:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 115 states have (on average 1.5391304347826087) internal successors, (177), 150 states have internal predecessors, (177), 0 states have call successors, (0), 0 states 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:44:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 177 transitions. [2021-12-07 01:44:05,739 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 177 transitions. Word has length 14 [2021-12-07 01:44:05,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:05,739 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 177 transitions. [2021-12-07 01:44:05,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 177 transitions. [2021-12-07 01:44:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-07 01:44:05,740 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:05,740 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:44:05,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-07 01:44:05,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:05,942 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:05,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:05,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1962503515, now seen corresponding path program 1 times [2021-12-07 01:44:05,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:05,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130052466] [2021-12-07 01:44:05,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:05,945 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:05,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:05,947 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:05,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-07 01:44:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:06,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-07 01:44:06,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:06,015 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:44:06,033 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:44:06,038 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:44:06,062 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 17 treesize of output 9 [2021-12-07 01:44:06,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-07 01:44:06,078 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:44:06,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:06,078 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:06,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130052466] [2021-12-07 01:44:06,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130052466] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:06,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:06,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:44:06,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645709332] [2021-12-07 01:44:06,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:06,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:44:06,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:06,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:44:06,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:44:06,080 INFO L87 Difference]: Start difference. First operand 151 states and 177 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:06,578 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2021-12-07 01:44:06,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:44:06,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-07 01:44:06,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:06,580 INFO L225 Difference]: With dead ends: 150 [2021-12-07 01:44:06,580 INFO L226 Difference]: Without dead ends: 150 [2021-12-07 01:44:06,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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:44:06,581 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 4 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:06,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 287 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-07 01:44:06,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-12-07 01:44:06,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-12-07 01:44:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 115 states have (on average 1.5217391304347827) internal successors, (175), 149 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:44:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2021-12-07 01:44:06,586 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 14 [2021-12-07 01:44:06,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:06,586 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2021-12-07 01:44:06,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:06,586 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2021-12-07 01:44:06,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-07 01:44:06,587 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:06,587 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:44:06,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-07 01:44:06,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:06,789 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:06,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:06,790 INFO L85 PathProgramCache]: Analyzing trace with hash -498964277, now seen corresponding path program 1 times [2021-12-07 01:44:06,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:06,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502193933] [2021-12-07 01:44:06,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:06,793 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:06,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:06,795 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:06,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-07 01:44:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:06,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 01:44:06,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:06,941 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:44:06,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:06,941 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:06,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502193933] [2021-12-07 01:44:06,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502193933] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:06,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:06,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:44:06,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542145019] [2021-12-07 01:44:06,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:06,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:44:06,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:06,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:44:06,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:44:06,943 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:44:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:07,224 INFO L93 Difference]: Finished difference Result 169 states and 188 transitions. [2021-12-07 01:44:07,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-07 01:44:07,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:44:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:07,225 INFO L225 Difference]: With dead ends: 169 [2021-12-07 01:44:07,226 INFO L226 Difference]: Without dead ends: 169 [2021-12-07 01:44:07,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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:44:07,227 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 172 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:07,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 162 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:44:07,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-12-07 01:44:07,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 150. [2021-12-07 01:44:07,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 115 states have (on average 1.5043478260869565) internal successors, (173), 149 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:07,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 173 transitions. [2021-12-07 01:44:07,234 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 173 transitions. Word has length 16 [2021-12-07 01:44:07,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:07,234 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 173 transitions. [2021-12-07 01:44:07,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:44:07,234 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 173 transitions. [2021-12-07 01:44:07,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-07 01:44:07,235 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:07,235 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:44:07,242 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-07 01:44:07,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:07,436 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:07,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:07,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1434057178, now seen corresponding path program 1 times [2021-12-07 01:44:07,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:07,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923667216] [2021-12-07 01:44:07,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:07,437 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:07,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:07,438 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:07,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-07 01:44:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:07,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-07 01:44:07,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:07,567 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-07 01:44:07,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2021-12-07 01:44:07,651 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-07 01:44:07,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 51 [2021-12-07 01:44:07,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-07 01:44:07,959 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:07,960 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 55 treesize of output 54 [2021-12-07 01:44:08,071 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 52 treesize of output 36 [2021-12-07 01:44:08,365 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:44:08,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:08,366 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:08,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923667216] [2021-12-07 01:44:08,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923667216] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:08,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:08,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:44:08,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384937543] [2021-12-07 01:44:08,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:08,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:44:08,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:08,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:44:08,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:44:08,367 INFO L87 Difference]: Start difference. First operand 150 states and 173 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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:44:08,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:08,855 INFO L93 Difference]: Finished difference Result 243 states and 282 transitions. [2021-12-07 01:44:08,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:44:08,856 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-07 01:44:08,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:08,857 INFO L225 Difference]: With dead ends: 243 [2021-12-07 01:44:08,857 INFO L226 Difference]: Without dead ends: 243 [2021-12-07 01:44:08,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-12-07 01:44:08,858 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 183 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:08,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 347 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 185 Invalid, 0 Unknown, 197 Unchecked, 0.4s Time] [2021-12-07 01:44:08,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-07 01:44:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 152. [2021-12-07 01:44:08,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 117 states have (on average 1.5042735042735043) internal successors, (176), 151 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 176 transitions. [2021-12-07 01:44:08,862 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 176 transitions. Word has length 18 [2021-12-07 01:44:08,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:08,862 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 176 transitions. [2021-12-07 01:44:08,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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:44:08,862 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 176 transitions. [2021-12-07 01:44:08,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-07 01:44:08,863 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:08,863 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:44:08,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-12-07 01:44:09,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:09,063 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:09,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:09,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1434057177, now seen corresponding path program 1 times [2021-12-07 01:44:09,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:09,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664602213] [2021-12-07 01:44:09,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:09,064 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:09,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:09,065 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:09,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-07 01:44:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:09,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-07 01:44:09,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:09,157 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:44:09,177 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:44:09,185 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:44:09,185 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 17 treesize of output 17 [2021-12-07 01:44:09,202 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-07 01:44:09,208 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:44:09,271 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:09,271 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 38 treesize of output 37 [2021-12-07 01:44:09,274 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 18 treesize of output 20 [2021-12-07 01:44:09,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-07 01:44:09,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-07 01:44:09,322 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:44:09,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:09,322 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:09,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664602213] [2021-12-07 01:44:09,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664602213] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:09,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:09,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:44:09,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046062445] [2021-12-07 01:44:09,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:09,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 01:44:09,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:09,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 01:44:09,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:44:09,324 INFO L87 Difference]: Start difference. First operand 152 states and 176 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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:44:10,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:10,290 INFO L93 Difference]: Finished difference Result 144 states and 165 transitions. [2021-12-07 01:44:10,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-07 01:44:10,291 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-12-07 01:44:10,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:10,292 INFO L225 Difference]: With dead ends: 144 [2021-12-07 01:44:10,292 INFO L226 Difference]: Without dead ends: 144 [2021-12-07 01:44:10,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2021-12-07 01:44:10,292 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 166 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:10,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 245 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-07 01:44:10,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-07 01:44:10,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2021-12-07 01:44:10,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 140 states have internal predecessors, (164), 0 states have call successors, (0), 0 states 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:44:10,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 164 transitions. [2021-12-07 01:44:10,295 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 164 transitions. Word has length 18 [2021-12-07 01:44:10,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:10,296 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 164 transitions. [2021-12-07 01:44:10,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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:44:10,296 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2021-12-07 01:44:10,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-07 01:44:10,296 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:10,296 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:44:10,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-07 01:44:10,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:10,498 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:10,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:10,499 INFO L85 PathProgramCache]: Analyzing trace with hash -822008851, now seen corresponding path program 1 times [2021-12-07 01:44:10,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:10,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60466081] [2021-12-07 01:44:10,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:10,507 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:10,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:10,508 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:10,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-07 01:44:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:10,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 01:44:10,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:10,588 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:44:10,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:10,588 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:10,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60466081] [2021-12-07 01:44:10,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60466081] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:10,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:10,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:44:10,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476144951] [2021-12-07 01:44:10,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:10,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-07 01:44:10,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:10,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-07 01:44:10,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-07 01:44:10,590 INFO L87 Difference]: Start difference. First operand 141 states and 164 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:10,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:10,603 INFO L93 Difference]: Finished difference Result 167 states and 198 transitions. [2021-12-07 01:44:10,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:44:10,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-07 01:44:10,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:10,604 INFO L225 Difference]: With dead ends: 167 [2021-12-07 01:44:10,604 INFO L226 Difference]: Without dead ends: 167 [2021-12-07 01:44:10,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:44:10,605 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 21 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:10,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 310 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:44:10,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-07 01:44:10,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 145. [2021-12-07 01:44:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 144 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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:44:10,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions. [2021-12-07 01:44:10,608 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 19 [2021-12-07 01:44:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:10,608 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 168 transitions. [2021-12-07 01:44:10,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:10,608 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions. [2021-12-07 01:44:10,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-07 01:44:10,609 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:10,609 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] [2021-12-07 01:44:10,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2021-12-07 01:44:10,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:10,811 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:10,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash -913566102, now seen corresponding path program 1 times [2021-12-07 01:44:10,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:10,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955753105] [2021-12-07 01:44:10,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:10,814 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:10,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:10,817 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:10,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-07 01:44:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:10,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-07 01:44:10,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:10,921 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:44:10,926 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:44:10,984 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:44:10,985 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:44:10,985 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 17 treesize of output 10 [2021-12-07 01:44:10,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:44:10,990 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:44:10,990 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 17 treesize of output 10 [2021-12-07 01:44:11,015 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:44:11,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:11,015 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:11,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955753105] [2021-12-07 01:44:11,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955753105] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:11,016 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:11,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 01:44:11,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687076135] [2021-12-07 01:44:11,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:11,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:44:11,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:11,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:44:11,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:44:11,017 INFO L87 Difference]: Start difference. First operand 145 states and 168 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:11,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:11,803 INFO L93 Difference]: Finished difference Result 270 states and 316 transitions. [2021-12-07 01:44:11,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-07 01:44:11,803 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-07 01:44:11,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:11,804 INFO L225 Difference]: With dead ends: 270 [2021-12-07 01:44:11,804 INFO L226 Difference]: Without dead ends: 270 [2021-12-07 01:44:11,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2021-12-07 01:44:11,805 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 267 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:11,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 430 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-07 01:44:11,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-12-07 01:44:11,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 154. [2021-12-07 01:44:11,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 130 states have (on average 1.376923076923077) internal successors, (179), 153 states have internal predecessors, (179), 0 states have call successors, (0), 0 states 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:44:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2021-12-07 01:44:11,809 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 21 [2021-12-07 01:44:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:11,809 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2021-12-07 01:44:11,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:11,809 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2021-12-07 01:44:11,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-07 01:44:11,810 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:11,810 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] [2021-12-07 01:44:11,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-07 01:44:12,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:12,011 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:12,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:12,012 INFO L85 PathProgramCache]: Analyzing trace with hash 332100342, now seen corresponding path program 1 times [2021-12-07 01:44:12,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:12,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652985588] [2021-12-07 01:44:12,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:12,014 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:12,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:12,016 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:12,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-07 01:44:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:12,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-07 01:44:12,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:12,087 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:44:12,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:12,087 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:12,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652985588] [2021-12-07 01:44:12,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652985588] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:12,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:12,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-07 01:44:12,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624178335] [2021-12-07 01:44:12,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:12,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:44:12,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:12,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:44:12,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:44:12,088 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:12,109 INFO L93 Difference]: Finished difference Result 178 states and 207 transitions. [2021-12-07 01:44:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:44:12,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-07 01:44:12,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:12,111 INFO L225 Difference]: With dead ends: 178 [2021-12-07 01:44:12,111 INFO L226 Difference]: Without dead ends: 178 [2021-12-07 01:44:12,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:44:12,111 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 25 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:12,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 407 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:44:12,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-12-07 01:44:12,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 158. [2021-12-07 01:44:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 134 states have (on average 1.3656716417910448) internal successors, (183), 157 states have internal predecessors, (183), 0 states have call successors, (0), 0 states 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:44:12,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2021-12-07 01:44:12,115 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 21 [2021-12-07 01:44:12,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:12,115 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2021-12-07 01:44:12,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2021-12-07 01:44:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-07 01:44:12,115 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:12,116 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:44:12,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-12-07 01:44:12,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:12,317 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:12,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:12,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1322487899, now seen corresponding path program 1 times [2021-12-07 01:44:12,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:12,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442566695] [2021-12-07 01:44:12,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:12,320 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:12,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:12,321 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:12,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-07 01:44:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:12,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-07 01:44:12,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:12,409 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:44:12,412 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:44:12,495 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:44:12,497 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:44:12,497 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 17 treesize of output 10 [2021-12-07 01:44:12,501 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:44:12,501 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 17 treesize of output 7 [2021-12-07 01:44:12,519 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:44:12,519 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:12,520 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:12,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442566695] [2021-12-07 01:44:12,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442566695] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:12,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:12,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 01:44:12,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487853977] [2021-12-07 01:44:12,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:12,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-07 01:44:12,520 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:12,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-07 01:44:12,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-07 01:44:12,521 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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:44:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:13,163 INFO L93 Difference]: Finished difference Result 236 states and 267 transitions. [2021-12-07 01:44:13,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-07 01:44:13,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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:44:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:13,165 INFO L225 Difference]: With dead ends: 236 [2021-12-07 01:44:13,165 INFO L226 Difference]: Without dead ends: 236 [2021-12-07 01:44:13,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2021-12-07 01:44:13,166 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 223 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:13,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [223 Valid, 353 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-07 01:44:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-12-07 01:44:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 166. [2021-12-07 01:44:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 142 states have (on average 1.3450704225352113) internal successors, (191), 165 states have internal predecessors, (191), 0 states have call successors, (0), 0 states 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:44:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 191 transitions. [2021-12-07 01:44:13,171 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 191 transitions. Word has length 23 [2021-12-07 01:44:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:13,172 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 191 transitions. [2021-12-07 01:44:13,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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:44:13,172 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 191 transitions. [2021-12-07 01:44:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-07 01:44:13,172 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:13,173 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:44:13,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-07 01:44:13,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:13,374 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:13,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:13,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1609197774, now seen corresponding path program 1 times [2021-12-07 01:44:13,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:13,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21936201] [2021-12-07 01:44:13,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:13,377 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:13,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:13,379 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:13,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-07 01:44:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:13,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-07 01:44:13,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:13,516 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-07 01:44:13,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2021-12-07 01:44:13,618 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-07 01:44:13,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 54 [2021-12-07 01:44:13,753 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:44:14,271 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:14,272 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 56 treesize of output 55 [2021-12-07 01:44:15,978 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 29 [2021-12-07 01:44:16,099 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:44:16,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:16,099 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:16,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21936201] [2021-12-07 01:44:16,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21936201] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:16,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:16,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 01:44:16,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330100662] [2021-12-07 01:44:16,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:16,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 01:44:16,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:16,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 01:44:16,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:44:16,100 INFO L87 Difference]: Start difference. First operand 166 states and 191 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 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:44:16,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:16,670 INFO L93 Difference]: Finished difference Result 271 states and 309 transitions. [2021-12-07 01:44:16,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:44:16,671 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 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:44:16,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:16,672 INFO L225 Difference]: With dead ends: 271 [2021-12-07 01:44:16,672 INFO L226 Difference]: Without dead ends: 271 [2021-12-07 01:44:16,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-12-07 01:44:16,673 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 269 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 462 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:16,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 488 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 67 Invalid, 0 Unknown, 462 Unchecked, 0.2s Time] [2021-12-07 01:44:16,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-12-07 01:44:16,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 177. [2021-12-07 01:44:16,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 153 states have (on average 1.3398692810457515) internal successors, (205), 176 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:44:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 205 transitions. [2021-12-07 01:44:16,676 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 205 transitions. Word has length 25 [2021-12-07 01:44:16,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:16,677 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 205 transitions. [2021-12-07 01:44:16,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 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:44:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2021-12-07 01:44:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-07 01:44:16,677 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:16,677 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:44:16,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-12-07 01:44:16,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:16,879 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:16,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:16,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1609197773, now seen corresponding path program 1 times [2021-12-07 01:44:16,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:16,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449747481] [2021-12-07 01:44:16,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:16,882 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:16,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:16,883 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:16,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-07 01:44:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:16,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-07 01:44:16,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:16,999 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:44:17,021 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:44:17,032 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:44:17,032 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 16 treesize of output 16 [2021-12-07 01:44:17,051 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:44:17,056 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:44:17,114 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:17,114 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:44:17,117 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:44:17,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-07 01:44:17,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-07 01:44:17,238 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:44:17,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:17,238 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:17,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449747481] [2021-12-07 01:44:17,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449747481] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:17,238 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:17,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 01:44:17,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511844001] [2021-12-07 01:44:17,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:17,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:44:17,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:17,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:44:17,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:44:17,239 INFO L87 Difference]: Start difference. First operand 177 states and 205 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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:44:18,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:18,354 INFO L93 Difference]: Finished difference Result 260 states and 294 transitions. [2021-12-07 01:44:18,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:44:18,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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:44:18,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:18,356 INFO L225 Difference]: With dead ends: 260 [2021-12-07 01:44:18,356 INFO L226 Difference]: Without dead ends: 260 [2021-12-07 01:44:18,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2021-12-07 01:44:18,357 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 201 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:18,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 451 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-07 01:44:18,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-12-07 01:44:18,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 177. [2021-12-07 01:44:18,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 153 states have (on average 1.3333333333333333) internal successors, (204), 176 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:44:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 204 transitions. [2021-12-07 01:44:18,360 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 204 transitions. Word has length 25 [2021-12-07 01:44:18,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:18,360 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 204 transitions. [2021-12-07 01:44:18,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 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:44:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 204 transitions. [2021-12-07 01:44:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-07 01:44:18,361 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:18,361 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:44:18,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2021-12-07 01:44:18,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:18,563 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:18,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:18,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1346931026, now seen corresponding path program 1 times [2021-12-07 01:44:18,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:18,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019813166] [2021-12-07 01:44:18,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:18,566 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:18,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:18,568 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:18,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-07 01:44:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:18,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-07 01:44:18,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:18,692 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:44:18,699 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:44:18,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2021-12-07 01:44:18,720 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:44:18,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:18,720 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:18,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019813166] [2021-12-07 01:44:18,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019813166] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:18,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:18,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:44:18,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655830764] [2021-12-07 01:44:18,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:18,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:44:18,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:18,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:44:18,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:44:18,722 INFO L87 Difference]: Start difference. First operand 177 states and 204 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:44:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:19,170 INFO L93 Difference]: Finished difference Result 185 states and 213 transitions. [2021-12-07 01:44:19,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:44:19,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:44:19,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:19,172 INFO L225 Difference]: With dead ends: 185 [2021-12-07 01:44:19,172 INFO L226 Difference]: Without dead ends: 185 [2021-12-07 01:44:19,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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:44:19,173 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 9 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:19,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 282 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:44:19,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-07 01:44:19,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 176. [2021-12-07 01:44:19,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 153 states have (on average 1.326797385620915) internal successors, (203), 175 states have internal predecessors, (203), 0 states have call successors, (0), 0 states 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:44:19,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 203 transitions. [2021-12-07 01:44:19,178 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 203 transitions. Word has length 25 [2021-12-07 01:44:19,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:19,178 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 203 transitions. [2021-12-07 01:44:19,178 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:44:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 203 transitions. [2021-12-07 01:44:19,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-07 01:44:19,179 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:19,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] [2021-12-07 01:44:19,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-07 01:44:19,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:19,380 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:19,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:19,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1346931027, now seen corresponding path program 1 times [2021-12-07 01:44:19,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:19,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31832880] [2021-12-07 01:44:19,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:19,385 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:19,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:19,388 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:19,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-07 01:44:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:19,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-07 01:44:19,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:19,523 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:44:19,534 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:44:19,539 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:44:19,564 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 21 treesize of output 9 [2021-12-07 01:44:19,568 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 19 treesize of output 7 [2021-12-07 01:44:19,579 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:44:19,579 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:19,579 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:19,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31832880] [2021-12-07 01:44:19,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31832880] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:19,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:19,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-07 01:44:19,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045172872] [2021-12-07 01:44:19,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:19,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:44:19,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:19,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:44:19,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:44:19,581 INFO L87 Difference]: Start difference. First operand 176 states and 203 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:44:20,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:20,003 INFO L93 Difference]: Finished difference Result 175 states and 202 transitions. [2021-12-07 01:44:20,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-07 01:44:20,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:44:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:20,005 INFO L225 Difference]: With dead ends: 175 [2021-12-07 01:44:20,005 INFO L226 Difference]: Without dead ends: 175 [2021-12-07 01:44:20,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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:44:20,005 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 2 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:20,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 273 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 01:44:20,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-12-07 01:44:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2021-12-07 01:44:20,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 153 states have (on average 1.3202614379084967) internal successors, (202), 174 states have internal predecessors, (202), 0 states have call successors, (0), 0 states 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:44:20,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 202 transitions. [2021-12-07 01:44:20,008 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 202 transitions. Word has length 25 [2021-12-07 01:44:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:20,008 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 202 transitions. [2021-12-07 01:44:20,008 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:44:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 202 transitions. [2021-12-07 01:44:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-07 01:44:20,009 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:20,009 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:44:20,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2021-12-07 01:44:20,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:20,210 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:20,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:20,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1459618013, now seen corresponding path program 1 times [2021-12-07 01:44:20,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:20,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527407442] [2021-12-07 01:44:20,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:20,211 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:20,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:20,213 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:20,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-07 01:44:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:20,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-07 01:44:20,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:20,314 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:44:20,324 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:44:20,346 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:44:20,347 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 14 treesize of output 14 [2021-12-07 01:44:20,370 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:44:20,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:44:20,377 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:44:20,409 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:44:20,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 16 treesize of output 18 [2021-12-07 01:44:20,474 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 19 treesize of output 7 [2021-12-07 01:44:20,506 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:44:20,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:20,507 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:20,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527407442] [2021-12-07 01:44:20,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527407442] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:20,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:20,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-07 01:44:20,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786003974] [2021-12-07 01:44:20,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:20,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 01:44:20,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:20,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 01:44:20,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:44:20,508 INFO L87 Difference]: Start difference. First operand 175 states and 202 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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:44:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:21,584 INFO L93 Difference]: Finished difference Result 255 states and 285 transitions. [2021-12-07 01:44:21,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-07 01:44:21,584 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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:44:21,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:21,586 INFO L225 Difference]: With dead ends: 255 [2021-12-07 01:44:21,586 INFO L226 Difference]: Without dead ends: 255 [2021-12-07 01:44:21,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2021-12-07 01:44:21,586 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 343 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:21,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 459 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-07 01:44:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-12-07 01:44:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 175. [2021-12-07 01:44:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 153 states have (on average 1.3137254901960784) internal successors, (201), 174 states have internal predecessors, (201), 0 states have call successors, (0), 0 states 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:44:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 201 transitions. [2021-12-07 01:44:21,590 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 201 transitions. Word has length 27 [2021-12-07 01:44:21,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:21,590 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 201 transitions. [2021-12-07 01:44:21,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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:44:21,590 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 201 transitions. [2021-12-07 01:44:21,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-07 01:44:21,591 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:21,591 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] [2021-12-07 01:44:21,599 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2021-12-07 01:44:21,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:21,791 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:21,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:21,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1491473498, now seen corresponding path program 1 times [2021-12-07 01:44:21,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:21,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51461477] [2021-12-07 01:44:21,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:21,792 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:21,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:21,793 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:21,793 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-07 01:44:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:21,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-07 01:44:21,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:21,876 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:44:21,879 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:44:21,897 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-07 01:44:21,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-07 01:44:21,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:44:21,902 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:44:21,923 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-07 01:44:21,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-07 01:44:21,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:44:21,927 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:44:21,940 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-07 01:44:21,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-07 01:44:21,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:44:21,944 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:44:22,010 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-07 01:44:22,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-07 01:44:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:44:22,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:44:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:44:22,118 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:22,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51461477] [2021-12-07 01:44:22,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51461477] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:44:22,119 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:44:22,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-12-07 01:44:22,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728087904] [2021-12-07 01:44:22,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:44:22,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:44:22,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:22,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:44:22,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:44:22,120 INFO L87 Difference]: Start difference. First operand 175 states and 201 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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:44:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:22,660 INFO L93 Difference]: Finished difference Result 215 states and 244 transitions. [2021-12-07 01:44:22,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-07 01:44:22,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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:44:22,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:22,661 INFO L225 Difference]: With dead ends: 215 [2021-12-07 01:44:22,661 INFO L226 Difference]: Without dead ends: 215 [2021-12-07 01:44:22,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-07 01:44:22,662 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 80 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:22,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 277 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-07 01:44:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-12-07 01:44:22,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 188. [2021-12-07 01:44:22,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 187 states have internal predecessors, (216), 0 states have call successors, (0), 0 states 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:44:22,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 216 transitions. [2021-12-07 01:44:22,667 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 216 transitions. Word has length 27 [2021-12-07 01:44:22,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:22,667 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 216 transitions. [2021-12-07 01:44:22,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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:44:22,668 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2021-12-07 01:44:22,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-07 01:44:22,668 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:22,668 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] [2021-12-07 01:44:22,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-12-07 01:44:22,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:22,869 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:22,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:22,869 INFO L85 PathProgramCache]: Analyzing trace with hash -834479840, now seen corresponding path program 1 times [2021-12-07 01:44:22,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:22,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846485260] [2021-12-07 01:44:22,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:22,870 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:22,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:22,870 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:22,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-07 01:44:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:22,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-07 01:44:22,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:23,103 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 19 treesize of output 7 [2021-12-07 01:44:23,106 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 19 treesize of output 7 [2021-12-07 01:44:23,131 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:44:23,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:23,132 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:23,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846485260] [2021-12-07 01:44:23,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846485260] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:23,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:23,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-07 01:44:23,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941708149] [2021-12-07 01:44:23,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:23,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:44:23,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:23,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:44:23,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:44:23,133 INFO L87 Difference]: Start difference. First operand 188 states and 216 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:23,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:23,995 INFO L93 Difference]: Finished difference Result 221 states and 244 transitions. [2021-12-07 01:44:23,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 01:44:23,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-07 01:44:23,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:23,997 INFO L225 Difference]: With dead ends: 221 [2021-12-07 01:44:23,997 INFO L226 Difference]: Without dead ends: 221 [2021-12-07 01:44:23,997 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2021-12-07 01:44:23,998 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 196 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:23,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 378 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-07 01:44:23,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-07 01:44:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 190. [2021-12-07 01:44:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 168 states have (on average 1.2976190476190477) internal successors, (218), 189 states have internal predecessors, (218), 0 states have call successors, (0), 0 states 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:44:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 218 transitions. [2021-12-07 01:44:24,002 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 218 transitions. Word has length 29 [2021-12-07 01:44:24,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:24,002 INFO L470 AbstractCegarLoop]: Abstraction has 190 states and 218 transitions. [2021-12-07 01:44:24,003 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 218 transitions. [2021-12-07 01:44:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-07 01:44:24,003 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:24,003 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:44:24,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-07 01:44:24,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:24,205 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:24,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:24,206 INFO L85 PathProgramCache]: Analyzing trace with hash 935468470, now seen corresponding path program 1 times [2021-12-07 01:44:24,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:24,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177471039] [2021-12-07 01:44:24,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:24,208 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:24,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:24,210 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:24,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-07 01:44:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:24,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-07 01:44:24,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:24,415 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:44:24,442 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-07 01:44:24,442 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 23 treesize of output 30 [2021-12-07 01:44:24,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-07 01:44:24,545 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:24,545 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 37 treesize of output 38 [2021-12-07 01:44:24,579 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 34 treesize of output 22 [2021-12-07 01:44:24,737 INFO L354 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2021-12-07 01:44:24,737 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 46 treesize of output 63 [2021-12-07 01:44:24,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:44:25,113 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:25,114 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 47 treesize of output 46 [2021-12-07 01:44:25,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2021-12-07 01:44:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:44:25,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:25,544 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:25,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177471039] [2021-12-07 01:44:25,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177471039] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:25,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:25,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-07 01:44:25,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328036269] [2021-12-07 01:44:25,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:25,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-07 01:44:25,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:25,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-07 01:44:25,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2021-12-07 01:44:25,545 INFO L87 Difference]: Start difference. First operand 190 states and 218 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 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:44:25,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:25,830 INFO L93 Difference]: Finished difference Result 209 states and 235 transitions. [2021-12-07 01:44:25,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-07 01:44:25,830 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 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:44:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:25,831 INFO L225 Difference]: With dead ends: 209 [2021-12-07 01:44:25,831 INFO L226 Difference]: Without dead ends: 209 [2021-12-07 01:44:25,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2021-12-07 01:44:25,832 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 125 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:25,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 284 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 257 Unchecked, 0.2s Time] [2021-12-07 01:44:25,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-07 01:44:25,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 191. [2021-12-07 01:44:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 169 states have (on average 1.301775147928994) internal successors, (220), 190 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2021-12-07 01:44:25,835 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 31 [2021-12-07 01:44:25,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:25,835 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2021-12-07 01:44:25,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 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:44:25,835 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2021-12-07 01:44:25,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-07 01:44:25,836 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:25,836 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:44:25,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2021-12-07 01:44:26,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:26,037 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:26,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:26,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1094686802, now seen corresponding path program 1 times [2021-12-07 01:44:26,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:26,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832347057] [2021-12-07 01:44:26,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:26,040 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:26,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:26,043 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:26,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-07 01:44:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:26,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-07 01:44:26,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:26,236 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-07 01:44:26,236 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 21 treesize of output 28 [2021-12-07 01:44:26,257 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-07 01:44:26,326 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:26,327 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 37 treesize of output 38 [2021-12-07 01:44:26,361 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 34 treesize of output 22 [2021-12-07 01:44:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:44:26,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:26,421 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:26,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832347057] [2021-12-07 01:44:26,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832347057] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:26,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:26,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-07 01:44:26,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228624212] [2021-12-07 01:44:26,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:26,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:44:26,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:26,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:44:26,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:44:26,422 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 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:44:26,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:26,629 INFO L93 Difference]: Finished difference Result 203 states and 234 transitions. [2021-12-07 01:44:26,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-07 01:44:26,630 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 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:44:26,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:26,630 INFO L225 Difference]: With dead ends: 203 [2021-12-07 01:44:26,630 INFO L226 Difference]: Without dead ends: 203 [2021-12-07 01:44:26,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:44:26,631 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 54 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:26,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 231 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 128 Unchecked, 0.2s Time] [2021-12-07 01:44:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-12-07 01:44:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 181. [2021-12-07 01:44:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 160 states have (on average 1.30625) internal successors, (209), 180 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:44:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 209 transitions. [2021-12-07 01:44:26,634 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 209 transitions. Word has length 31 [2021-12-07 01:44:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:26,634 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 209 transitions. [2021-12-07 01:44:26,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 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:44:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 209 transitions. [2021-12-07 01:44:26,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-07 01:44:26,635 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:26,635 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:44:26,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-07 01:44:26,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:26,836 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:26,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:26,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1955979153, now seen corresponding path program 1 times [2021-12-07 01:44:26,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:26,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529601523] [2021-12-07 01:44:26,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:26,840 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:26,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:26,841 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:26,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-07 01:44:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:26,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-07 01:44:26,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:26,976 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:44:26,989 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:44:26,989 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 14 treesize of output 14 [2021-12-07 01:44:26,997 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:44:27,046 INFO L354 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2021-12-07 01:44:27,047 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 69 treesize of output 47 [2021-12-07 01:44:27,050 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 49 treesize of output 39 [2021-12-07 01:44:27,237 INFO L354 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2021-12-07 01:44:27,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 40 [2021-12-07 01:44:27,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 10 [2021-12-07 01:44:27,289 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:44:27,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:27,289 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:27,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529601523] [2021-12-07 01:44:27,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529601523] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:27,289 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:27,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-07 01:44:27,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617982573] [2021-12-07 01:44:27,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:27,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-07 01:44:27,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:27,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-07 01:44:27,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-12-07 01:44:27,290 INFO L87 Difference]: Start difference. First operand 181 states and 209 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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:44:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:28,812 INFO L93 Difference]: Finished difference Result 262 states and 291 transitions. [2021-12-07 01:44:28,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-07 01:44:28,813 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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:44:28,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:28,814 INFO L225 Difference]: With dead ends: 262 [2021-12-07 01:44:28,814 INFO L226 Difference]: Without dead ends: 262 [2021-12-07 01:44:28,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2021-12-07 01:44:28,815 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 157 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:28,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 674 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 634 Invalid, 0 Unknown, 82 Unchecked, 1.1s Time] [2021-12-07 01:44:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-12-07 01:44:28,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 178. [2021-12-07 01:44:28,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 157 states have (on average 1.2993630573248407) internal successors, (204), 177 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:44:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 204 transitions. [2021-12-07 01:44:28,818 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 204 transitions. Word has length 32 [2021-12-07 01:44:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:28,818 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 204 transitions. [2021-12-07 01:44:28,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 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:44:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 204 transitions. [2021-12-07 01:44:28,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-07 01:44:28,818 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:28,818 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:44:28,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-07 01:44:29,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:29,020 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:29,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:29,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1694086802, now seen corresponding path program 1 times [2021-12-07 01:44:29,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:29,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033897837] [2021-12-07 01:44:29,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:29,021 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:29,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:29,022 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:29,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-07 01:44:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:29,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-07 01:44:29,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:29,223 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:44:29,235 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:44:29,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:44:29,323 INFO L354 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2021-12-07 01:44:29,323 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 20 treesize of output 15 [2021-12-07 01:44:29,335 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:44:29,335 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:29,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033897837] [2021-12-07 01:44:29,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033897837] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:44:29,335 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:44:29,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-12-07 01:44:29,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449246383] [2021-12-07 01:44:29,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:44:29,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-07 01:44:29,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:29,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-07 01:44:29,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-07 01:44:29,336 INFO L87 Difference]: Start difference. First operand 178 states and 204 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:33,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:33,757 INFO L93 Difference]: Finished difference Result 269 states and 297 transitions. [2021-12-07 01:44:33,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-07 01:44:33,758 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-07 01:44:33,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:33,759 INFO L225 Difference]: With dead ends: 269 [2021-12-07 01:44:33,759 INFO L226 Difference]: Without dead ends: 269 [2021-12-07 01:44:33,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2021-12-07 01:44:33,760 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 277 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:33,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 512 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-07 01:44:33,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-12-07 01:44:33,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 220. [2021-12-07 01:44:33,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 199 states have (on average 1.3015075376884422) internal successors, (259), 219 states have internal predecessors, (259), 0 states have call successors, (0), 0 states 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:44:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 259 transitions. [2021-12-07 01:44:33,764 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 259 transitions. Word has length 34 [2021-12-07 01:44:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:33,764 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 259 transitions. [2021-12-07 01:44:33,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:33,765 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 259 transitions. [2021-12-07 01:44:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-07 01:44:33,765 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:33,765 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:44:33,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-07 01:44:33,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:33,966 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:33,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:33,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1694075817, now seen corresponding path program 1 times [2021-12-07 01:44:33,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:33,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1489386714] [2021-12-07 01:44:33,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:33,967 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:33,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:33,967 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:33,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-07 01:44:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:34,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-07 01:44:34,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:44:34,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:44:34,176 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:34,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1489386714] [2021-12-07 01:44:34,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1489386714] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:44:34,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:44:34,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:44:34,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571186220] [2021-12-07 01:44:34,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:44:34,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-07 01:44:34,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:34,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-07 01:44:34,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-07 01:44:34,178 INFO L87 Difference]: Start difference. First operand 220 states and 259 transitions. Second operand has 5 states, 4 states have (on average 8.5) 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:44:34,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:34,455 INFO L93 Difference]: Finished difference Result 245 states and 278 transitions. [2021-12-07 01:44:34,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:44:34,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) 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:44:34,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:34,456 INFO L225 Difference]: With dead ends: 245 [2021-12-07 01:44:34,456 INFO L226 Difference]: Without dead ends: 245 [2021-12-07 01:44:34,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:44:34,457 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 178 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:34,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 131 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 01:44:34,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-12-07 01:44:34,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 222. [2021-12-07 01:44:34,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 201 states have (on average 1.2985074626865671) internal successors, (261), 221 states have internal predecessors, (261), 0 states have call successors, (0), 0 states 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:44:34,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 261 transitions. [2021-12-07 01:44:34,460 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 261 transitions. Word has length 34 [2021-12-07 01:44:34,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:34,460 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 261 transitions. [2021-12-07 01:44:34,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) 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:44:34,460 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 261 transitions. [2021-12-07 01:44:34,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-07 01:44:34,461 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:34,461 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:44:34,468 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2021-12-07 01:44:34,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:34,662 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:34,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:34,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1837503706, now seen corresponding path program 1 times [2021-12-07 01:44:34,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:34,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828957323] [2021-12-07 01:44:34,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:34,665 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:34,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:34,668 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:34,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-07 01:44:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:34,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-07 01:44:34,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:34,890 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:44:34,912 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:44:34,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:44:34,928 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:44:34,960 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:44:34,961 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 16 treesize of output 16 [2021-12-07 01:44:34,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:44:34,990 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:44:34,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-07 01:44:35,074 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:35,075 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 29 treesize of output 30 [2021-12-07 01:44:35,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 20 treesize of output 22 [2021-12-07 01:44:35,098 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-07 01:44:35,135 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:44:35,152 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:44:35,163 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:44:35,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-07 01:44:35,227 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:44:35,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:44:35,300 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1087 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1087) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32)))) is different from false [2021-12-07 01:44:35,318 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1087 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1087) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:44:35,324 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1087 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1087) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:44:35,338 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1087 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1083) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1084) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1087) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32)))) is different from false [2021-12-07 01:44:35,352 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1087 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1083) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1084) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1087)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:44:35,370 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:44:35,370 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 39 treesize of output 40 [2021-12-07 01:44:35,373 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 73 treesize of output 65 [2021-12-07 01:44:35,382 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 26 treesize of output 24 [2021-12-07 01:44:35,517 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_6| (_ BitVec 32))) (or (let ((.cse0 (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|))) (and (or (forall ((v_ArrVal_1083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1082 (_ BitVec 32)) (v_ArrVal_1087 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_95 (_ BitVec 32))) (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1082)) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1083) v_arrayElimCell_95 v_ArrVal_1087) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (not .cse0)) (or .cse0 (forall ((v_ArrVal_1082 (_ BitVec 32)) (v_ArrVal_1087 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1082)) |v_ULTIMATE.start_main_#t~malloc7#1.base_6| v_ArrVal_1087) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_6|)))))) is different from false [2021-12-07 01:44:35,875 INFO L354 Elim1Store]: treesize reduction 156, result has 26.8 percent of original size [2021-12-07 01:44:35,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 96 [2021-12-07 01:44:35,884 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-07 01:44:35,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 122 [2021-12-07 01:44:35,893 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-07 01:44:35,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 115 [2021-12-07 01:44:35,900 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 26 treesize of output 22 [2021-12-07 01:44:35,902 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 22 treesize of output 18 [2021-12-07 01:44:35,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-07 01:44:35,944 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:35,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828957323] [2021-12-07 01:44:35,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828957323] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:44:35,944 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:44:35,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2021-12-07 01:44:35,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996995729] [2021-12-07 01:44:35,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:44:35,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-07 01:44:35,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:35,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-07 01:44:35,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=336, Unknown=20, NotChecked=258, Total=702 [2021-12-07 01:44:35,945 INFO L87 Difference]: Start difference. First operand 222 states and 261 transitions. Second operand has 27 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 27 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:40,479 INFO L93 Difference]: Finished difference Result 458 states and 517 transitions. [2021-12-07 01:44:40,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-12-07 01:44:40,480 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 27 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-07 01:44:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:40,482 INFO L225 Difference]: With dead ends: 458 [2021-12-07 01:44:40,482 INFO L226 Difference]: Without dead ends: 458 [2021-12-07 01:44:40,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=419, Invalid=1559, Unknown=26, NotChecked=546, Total=2550 [2021-12-07 01:44:40,483 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 638 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1328 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:40,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [638 Valid, 1023 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 761 Invalid, 0 Unknown, 1328 Unchecked, 1.2s Time] [2021-12-07 01:44:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2021-12-07 01:44:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 254. [2021-12-07 01:44:40,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 233 states have (on average 1.2832618025751072) internal successors, (299), 253 states have internal predecessors, (299), 0 states have call successors, (0), 0 states 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:44:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 299 transitions. [2021-12-07 01:44:40,487 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 299 transitions. Word has length 34 [2021-12-07 01:44:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:40,487 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 299 transitions. [2021-12-07 01:44:40,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 27 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 299 transitions. [2021-12-07 01:44:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-07 01:44:40,488 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:40,488 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:44:40,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2021-12-07 01:44:40,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:40,689 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:40,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:40,690 INFO L85 PathProgramCache]: Analyzing trace with hash 601359066, now seen corresponding path program 1 times [2021-12-07 01:44:40,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:40,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217666305] [2021-12-07 01:44:40,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:40,692 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:40,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:40,694 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:40,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-12-07 01:44:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:40,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-07 01:44:40,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:40,986 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:44:41,009 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:44:41,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:44:41,027 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:44:41,064 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:44:41,064 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 14 treesize of output 14 [2021-12-07 01:44:41,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:44:41,096 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:44:41,102 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-07 01:44:41,182 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:41,182 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 29 treesize of output 30 [2021-12-07 01:44:41,185 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 20 treesize of output 22 [2021-12-07 01:44:41,209 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-07 01:44:41,253 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:44:41,275 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:44:41,284 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:44:41,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-07 01:44:41,358 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:44:41,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:44:41,432 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1159) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:44:41,450 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1159) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:44:41,456 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1159) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:44:41,469 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1156 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1155) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1156) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1159) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32)))) is different from false [2021-12-07 01:44:41,479 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1156 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1155) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1156) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1159)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:44:41,493 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:44:41,493 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 39 treesize of output 40 [2021-12-07 01:44:41,495 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 73 treesize of output 65 [2021-12-07 01:44:41,497 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 26 treesize of output 24 [2021-12-07 01:44:41,509 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc7#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (or (not .cse0) (forall ((v_ArrVal_1155 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_116 (_ BitVec 32)) (v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1152 (_ BitVec 32))) (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1152)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1155) v_arrayElimCell_116 v_ArrVal_1159) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (or .cse0 (forall ((v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1152 (_ BitVec 32))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1152)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1159) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2021-12-07 01:44:42,032 INFO L354 Elim1Store]: treesize reduction 156, result has 26.8 percent of original size [2021-12-07 01:44:42,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 96 [2021-12-07 01:44:42,039 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-07 01:44:42,040 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 144 treesize of output 122 [2021-12-07 01:44:42,047 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-07 01:44:42,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 115 [2021-12-07 01:44:42,052 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 26 treesize of output 22 [2021-12-07 01:44:42,053 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 22 treesize of output 18 [2021-12-07 01:44:42,102 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:44:42,102 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:42,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217666305] [2021-12-07 01:44:42,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217666305] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:44:42,102 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:44:42,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2021-12-07 01:44:42,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309833096] [2021-12-07 01:44:42,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:44:42,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-07 01:44:42,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:42,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-07 01:44:42,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=332, Unknown=23, NotChecked=258, Total=702 [2021-12-07 01:44:42,103 INFO L87 Difference]: Start difference. First operand 254 states and 299 transitions. Second operand has 27 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 27 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:48,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:48,288 INFO L93 Difference]: Finished difference Result 397 states and 452 transitions. [2021-12-07 01:44:48,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-07 01:44:48,289 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 27 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-07 01:44:48,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:48,290 INFO L225 Difference]: With dead ends: 397 [2021-12-07 01:44:48,290 INFO L226 Difference]: Without dead ends: 397 [2021-12-07 01:44:48,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=345, Invalid=1137, Unknown=24, NotChecked=474, Total=1980 [2021-12-07 01:44:48,291 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 320 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 2389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1407 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:48,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [320 Valid, 1300 Invalid, 2389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 903 Invalid, 0 Unknown, 1407 Unchecked, 1.5s Time] [2021-12-07 01:44:48,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-12-07 01:44:48,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 242. [2021-12-07 01:44:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 221 states have (on average 1.2850678733031675) internal successors, (284), 241 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:48,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 284 transitions. [2021-12-07 01:44:48,295 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 284 transitions. Word has length 34 [2021-12-07 01:44:48,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:48,295 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 284 transitions. [2021-12-07 01:44:48,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 27 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 284 transitions. [2021-12-07 01:44:48,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 01:44:48,296 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:48,296 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] [2021-12-07 01:44:48,304 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2021-12-07 01:44:48,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:48,497 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:48,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:48,498 INFO L85 PathProgramCache]: Analyzing trace with hash -599280949, now seen corresponding path program 1 times [2021-12-07 01:44:48,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:48,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258592688] [2021-12-07 01:44:48,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:48,500 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:48,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:48,502 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:48,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-07 01:44:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:48,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-07 01:44:48,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:48,745 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:44:48,766 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:44:48,771 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:44:48,822 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:44:48,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-07 01:44:48,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:44:48,859 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 21 treesize of output 20 [2021-12-07 01:44:48,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:44:48,869 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 21 treesize of output 20 [2021-12-07 01:44:48,951 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:48,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 37 [2021-12-07 01:44:48,954 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 20 treesize of output 22 [2021-12-07 01:44:49,051 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:49,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-07 01:44:49,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:44:49,059 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:44:49,096 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-07 01:44:49,096 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-07 01:44:49,099 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 7 treesize of output 3 [2021-12-07 01:44:49,115 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:49,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-07 01:44:49,147 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:49,148 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 38 treesize of output 37 [2021-12-07 01:44:49,151 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 20 treesize of output 22 [2021-12-07 01:44:49,268 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:44:49,269 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:44:49,269 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 17 treesize of output 10 [2021-12-07 01:44:49,272 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:44:49,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:44:49,274 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:44:49,274 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 25 treesize of output 14 [2021-12-07 01:44:49,314 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:44:49,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:44:49,443 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1234 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1234) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1233 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1233) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-07 01:44:49,477 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1234 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1234) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1233) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:44:49,488 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1233 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1233) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1234 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1234) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-07 01:44:49,511 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1228) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1227) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1234) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1227))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1233)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:44:49,531 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1227))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1233)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1228) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1227) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1234)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-07 01:44:49,572 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1227))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1233)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1225 (_ BitVec 32)) (v_ArrVal_1234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1225)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1228) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1227) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1234) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-07 01:44:50,008 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-07 01:44:50,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 103 [2021-12-07 01:44:50,058 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-07 01:44:50,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 82 [2021-12-07 01:44:50,066 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 01:44:50,067 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 220 treesize of output 184 [2021-12-07 01:44:50,077 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 01:44:50,078 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 354 treesize of output 326 [2021-12-07 01:44:50,091 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 156 treesize of output 140 [2021-12-07 01:44:50,094 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 140 treesize of output 128 [2021-12-07 01:44:50,098 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 128 treesize of output 120 [2021-12-07 01:44:50,104 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 01:44:50,105 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 120 treesize of output 112 [2021-12-07 01:44:50,108 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:44:50,168 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:44:50,168 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:50,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258592688] [2021-12-07 01:44:50,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258592688] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:44:50,168 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:44:50,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2021-12-07 01:44:50,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773338349] [2021-12-07 01:44:50,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:44:50,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-07 01:44:50,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:50,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-07 01:44:50,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=310, Unknown=14, NotChecked=246, Total=650 [2021-12-07 01:44:50,169 INFO L87 Difference]: Start difference. First operand 242 states and 284 transitions. Second operand has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:52,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:52,302 INFO L93 Difference]: Finished difference Result 373 states and 422 transitions. [2021-12-07 01:44:52,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-07 01:44:52,303 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-07 01:44:52,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:52,304 INFO L225 Difference]: With dead ends: 373 [2021-12-07 01:44:52,304 INFO L226 Difference]: Without dead ends: 373 [2021-12-07 01:44:52,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=264, Invalid=868, Unknown=14, NotChecked=414, Total=1560 [2021-12-07 01:44:52,305 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 242 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1188 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:52,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 944 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 735 Invalid, 0 Unknown, 1188 Unchecked, 1.2s Time] [2021-12-07 01:44:52,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2021-12-07 01:44:52,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 271. [2021-12-07 01:44:52,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 250 states have (on average 1.268) internal successors, (317), 270 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:52,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 317 transitions. [2021-12-07 01:44:52,310 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 317 transitions. Word has length 36 [2021-12-07 01:44:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:52,310 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 317 transitions. [2021-12-07 01:44:52,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 317 transitions. [2021-12-07 01:44:52,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-07 01:44:52,310 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:52,310 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] [2021-12-07 01:44:52,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2021-12-07 01:44:52,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:52,512 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:52,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:52,513 INFO L85 PathProgramCache]: Analyzing trace with hash -451088445, now seen corresponding path program 1 times [2021-12-07 01:44:52,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:52,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679007451] [2021-12-07 01:44:52,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:52,515 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:52,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:52,516 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:52,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-12-07 01:44:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:52,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-07 01:44:52,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:52,705 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:44:52,737 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:44:52,742 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:44:52,799 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:44:52,799 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 15 treesize of output 15 [2021-12-07 01:44:52,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:44:52,826 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:44:52,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:44:52,835 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 21 treesize of output 20 [2021-12-07 01:44:52,924 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:52,924 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 37 [2021-12-07 01:44:52,928 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 20 treesize of output 22 [2021-12-07 01:44:53,028 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-07 01:44:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-07 01:44:53,031 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 7 treesize of output 3 [2021-12-07 01:44:53,050 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:53,051 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-07 01:44:53,107 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:53,108 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-07 01:44:53,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:44:53,117 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:44:53,133 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:53,134 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 38 treesize of output 37 [2021-12-07 01:44:53,137 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 20 treesize of output 22 [2021-12-07 01:44:53,257 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:44:53,258 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:44:53,258 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 17 treesize of output 10 [2021-12-07 01:44:53,261 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:44:53,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:44:53,263 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:44:53,263 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 25 treesize of output 14 [2021-12-07 01:44:53,303 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:44:53,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:44:53,438 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1309) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-07 01:44:53,471 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1309) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-07 01:44:53,485 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1309) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1308 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1308) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-07 01:44:53,511 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1302) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1303) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1308) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1303))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1309)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-07 01:44:53,530 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1303))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1309)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1302) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1303) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1308)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-07 01:44:53,575 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1303))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1309)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1298 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1298)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1302) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1303) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1308) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:44:53,648 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1303))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1309)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1298 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1298)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1302) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1303) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1308) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))))) is different from false [2021-12-07 01:44:53,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_15| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|))) (and (forall ((v_ArrVal_1309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1303))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1309)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1302 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1303 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1298 (_ BitVec 32))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1298)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1302) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_15|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_15| v_ArrVal_1303) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1308) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:44:53,783 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-07 01:44:53,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 103 [2021-12-07 01:44:53,838 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-07 01:44:53,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 82 [2021-12-07 01:44:53,845 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 01:44:53,845 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 220 treesize of output 184 [2021-12-07 01:44:53,853 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 01:44:53,853 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 280 treesize of output 258 [2021-12-07 01:44:53,862 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 70 treesize of output 66 [2021-12-07 01:44:53,864 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 62 [2021-12-07 01:44:53,866 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 62 treesize of output 58 [2021-12-07 01:44:53,871 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 01:44:53,872 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 58 treesize of output 50 [2021-12-07 01:44:53,874 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 46 [2021-12-07 01:44:53,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-07 01:44:53,911 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:53,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679007451] [2021-12-07 01:44:53,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679007451] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:44:53,911 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:44:53,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2021-12-07 01:44:53,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521753715] [2021-12-07 01:44:53,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:44:53,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-07 01:44:53,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:53,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-07 01:44:53,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=254, Unknown=8, NotChecked=312, Total=650 [2021-12-07 01:44:53,912 INFO L87 Difference]: Start difference. First operand 271 states and 317 transitions. Second operand has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:56,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:56,035 INFO L93 Difference]: Finished difference Result 361 states and 410 transitions. [2021-12-07 01:44:56,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-07 01:44:56,035 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-12-07 01:44:56,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:56,037 INFO L225 Difference]: With dead ends: 361 [2021-12-07 01:44:56,037 INFO L226 Difference]: Without dead ends: 361 [2021-12-07 01:44:56,037 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=211, Invalid=681, Unknown=10, NotChecked=504, Total=1406 [2021-12-07 01:44:56,037 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 214 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1183 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:56,038 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 764 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 820 Invalid, 0 Unknown, 1183 Unchecked, 1.4s Time] [2021-12-07 01:44:56,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-12-07 01:44:56,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 249. [2021-12-07 01:44:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 228 states have (on average 1.2763157894736843) internal successors, (291), 248 states have internal predecessors, (291), 0 states have call successors, (0), 0 states 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:44:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 291 transitions. [2021-12-07 01:44:56,041 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 291 transitions. Word has length 36 [2021-12-07 01:44:56,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:56,041 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 291 transitions. [2021-12-07 01:44:56,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:44:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 291 transitions. [2021-12-07 01:44:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-07 01:44:56,042 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:56,042 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:44:56,050 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2021-12-07 01:44:56,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:56,243 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:56,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:56,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1948285357, now seen corresponding path program 1 times [2021-12-07 01:44:56,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:56,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687825801] [2021-12-07 01:44:56,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:56,246 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:56,247 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:56,248 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:56,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-07 01:44:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:56,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-07 01:44:56,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:56,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-07 01:44:56,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-07 01:44:56,545 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:44:56,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:44:56,647 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-07 01:44:56,648 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 24 treesize of output 23 [2021-12-07 01:44:56,654 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-12-07 01:44:56,655 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 20 treesize of output 12 [2021-12-07 01:44:56,706 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:44:56,706 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:44:56,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687825801] [2021-12-07 01:44:56,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687825801] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:44:56,706 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:44:56,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-12-07 01:44:56,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360503689] [2021-12-07 01:44:56,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:44:56,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 01:44:56,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:44:56,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 01:44:56,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-07 01:44:56,708 INFO L87 Difference]: Start difference. First operand 249 states and 291 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) 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:44:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:44:57,934 INFO L93 Difference]: Finished difference Result 350 states and 406 transitions. [2021-12-07 01:44:57,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-07 01:44:57,934 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) 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 37 [2021-12-07 01:44:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:44:57,935 INFO L225 Difference]: With dead ends: 350 [2021-12-07 01:44:57,935 INFO L226 Difference]: Without dead ends: 350 [2021-12-07 01:44:57,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2021-12-07 01:44:57,936 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 273 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:44:57,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 540 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-07 01:44:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2021-12-07 01:44:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 276. [2021-12-07 01:44:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 255 states have (on average 1.2745098039215685) internal successors, (325), 275 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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:44:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 325 transitions. [2021-12-07 01:44:57,940 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 325 transitions. Word has length 37 [2021-12-07 01:44:57,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:44:57,940 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 325 transitions. [2021-12-07 01:44:57,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) 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:44:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 325 transitions. [2021-12-07 01:44:57,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-07 01:44:57,941 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:44:57,941 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:44:57,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2021-12-07 01:44:58,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:44:58,142 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:44:58,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:44:58,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1749935854, now seen corresponding path program 1 times [2021-12-07 01:44:58,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:44:58,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369536288] [2021-12-07 01:44:58,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:44:58,144 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:44:58,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:44:58,145 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:44:58,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-12-07 01:44:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:44:58,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-07 01:44:58,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:44:58,402 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:44:58,432 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-07 01:44:58,433 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 22 treesize of output 29 [2021-12-07 01:44:58,461 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:44:58,536 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:58,536 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 39 treesize of output 40 [2021-12-07 01:44:58,614 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-12-07 01:44:58,614 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 34 treesize of output 57 [2021-12-07 01:44:58,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:44:58,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2021-12-07 01:44:58,856 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:58,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 62 [2021-12-07 01:44:59,085 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:59,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 58 [2021-12-07 01:44:59,166 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:59,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 58 [2021-12-07 01:44:59,204 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:44:59,204 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 65 treesize of output 60 [2021-12-07 01:44:59,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2021-12-07 01:44:59,737 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:44:59,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:44:59,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1414 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1414) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (_ bv1 1)))) is different from false [2021-12-07 01:44:59,976 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1414 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1414) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))) (_ bv1 1)))) is different from false [2021-12-07 01:44:59,994 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1414 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1411))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1414)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))))))) (_ bv1 1)) (_ bv0 1))) is different from false [2021-12-07 01:45:00,009 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1414 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1411))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1414)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))))))))))))) is different from false [2021-12-07 01:45:00,039 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1414 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1411))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1414)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))))))))))))))) is different from false [2021-12-07 01:45:00,066 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1408 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_18| (_ BitVec 32)) (v_ArrVal_1411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1414 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1408) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1411))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1414)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))))))))))) (_ bv1 1))))) is different from false [2021-12-07 01:45:00,095 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1408 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_18| (_ BitVec 32)) (v_ArrVal_1411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1414 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1408) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1411))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1414)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))))))))))) (_ bv1 1))))) is different from false [2021-12-07 01:45:00,149 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1408 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_18| (_ BitVec 32)) (v_ArrVal_1411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1414 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1408) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1407))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1411))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1414)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))))))))))))))))) is different from false [2021-12-07 01:45:00,189 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1407 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1408 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_18| (_ BitVec 32)) (v_ArrVal_1411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1414 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1408) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) v_ArrVal_1407))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_18|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_18| v_ArrVal_1411))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1414)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))))))))))))))))) (_ bv1 1))))) is different from false [2021-12-07 01:45:00,235 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:45:00,236 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 117 treesize of output 88 [2021-12-07 01:45:00,239 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:45:00,243 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 184 treesize of output 180 [2021-12-07 01:45:00,247 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:45:00,251 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 92 treesize of output 84 [2021-12-07 01:45:00,255 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:45:00,258 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 82 treesize of output 78 [2021-12-07 01:45:00,262 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 150 [2021-12-07 01:45:02,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-07 01:45:02,700 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:45:02,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369536288] [2021-12-07 01:45:02,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369536288] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:45:02,700 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:45:02,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2021-12-07 01:45:02,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138601930] [2021-12-07 01:45:02,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:45:02,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-12-07 01:45:02,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:45:02,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-12-07 01:45:02,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=371, Unknown=11, NotChecked=432, Total=930 [2021-12-07 01:45:02,702 INFO L87 Difference]: Start difference. First operand 276 states and 325 transitions. Second operand has 31 states, 30 states have (on average 2.5) internal successors, (75), 31 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:45:06,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:45:06,797 INFO L93 Difference]: Finished difference Result 362 states and 424 transitions. [2021-12-07 01:45:06,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-07 01:45:06,798 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.5) internal successors, (75), 31 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-07 01:45:06,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:45:06,799 INFO L225 Difference]: With dead ends: 362 [2021-12-07 01:45:06,800 INFO L226 Difference]: Without dead ends: 362 [2021-12-07 01:45:06,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 24 SemanticMatches, 33 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=162, Invalid=513, Unknown=11, NotChecked=504, Total=1190 [2021-12-07 01:45:06,800 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 139 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 2185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1882 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-07 01:45:06,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 1357 Invalid, 2185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 291 Invalid, 0 Unknown, 1882 Unchecked, 0.6s Time] [2021-12-07 01:45:06,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-12-07 01:45:06,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 300. [2021-12-07 01:45:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 279 states have (on average 1.2724014336917562) internal successors, (355), 299 states have internal predecessors, (355), 0 states have call successors, (0), 0 states 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:45:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 355 transitions. [2021-12-07 01:45:06,804 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 355 transitions. Word has length 38 [2021-12-07 01:45:06,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:45:06,805 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 355 transitions. [2021-12-07 01:45:06,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.5) internal successors, (75), 31 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:45:06,805 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 355 transitions. [2021-12-07 01:45:06,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-07 01:45:06,805 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:45:06,805 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:45:06,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2021-12-07 01:45:07,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:45:07,006 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:45:07,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:45:07,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1749935853, now seen corresponding path program 1 times [2021-12-07 01:45:07,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:45:07,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826979971] [2021-12-07 01:45:07,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:45:07,008 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:45:07,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:45:07,010 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:45:07,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-12-07 01:45:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:45:07,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-07 01:45:07,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:45:07,321 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:45:07,353 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-07 01:45:07,353 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 22 treesize of output 29 [2021-12-07 01:45:07,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-07 01:45:07,390 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:45:07,398 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:45:07,490 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:45:07,490 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 61 treesize of output 58 [2021-12-07 01:45:07,494 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:45:07,583 INFO L354 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2021-12-07 01:45:07,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2021-12-07 01:45:07,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:45:07,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:07,649 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:45:07,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:07,657 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 43 treesize of output 30 [2021-12-07 01:45:07,821 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:45:07,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 57 [2021-12-07 01:45:07,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2021-12-07 01:45:08,028 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:45:08,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 49 [2021-12-07 01:45:08,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:08,048 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:45:08,123 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-07 01:45:08,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-07 01:45:08,127 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 7 treesize of output 3 [2021-12-07 01:45:08,148 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:45:08,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 49 [2021-12-07 01:45:08,208 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:45:08,208 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 64 treesize of output 57 [2021-12-07 01:45:08,213 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 20 treesize of output 22 [2021-12-07 01:45:08,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-07 01:45:08,485 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:45:08,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 21 [2021-12-07 01:45:08,516 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:45:08,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:45:08,895 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1501) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1502 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1501) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2021-12-07 01:45:08,978 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1501) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1502 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1501) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1502) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2021-12-07 01:45:09,011 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1502 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1501) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1502) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1501) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2021-12-07 01:45:09,093 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1496 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1495 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1502 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1496))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1495) .cse0 v_ArrVal_1501) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1502) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1496 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1495 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1495) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1496) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1501) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))) is different from false [2021-12-07 01:45:09,153 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1496 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1495 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1495) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1496) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1501)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1496 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1495 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1502 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1496))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1495) .cse3 v_ArrVal_1501) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_1502) |c_ULTIMATE.start_main_~head~0#1.base|) .cse4)))))))) is different from false [2021-12-07 01:45:09,274 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1496 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1495 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1491 (_ BitVec 32)) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1502 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1496))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1491)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1495) .cse0 v_ArrVal_1501) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1502) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1496 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1495 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1491 (_ BitVec 32)) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1491)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1495) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1496) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1501) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))) is different from false [2021-12-07 01:45:09,792 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_21| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|))) (and (forall ((v_ArrVal_1496 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1495 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1491 (_ BitVec 32)) (v_ArrVal_1490 (_ BitVec 32)) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1502 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1496))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1491)) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1495) .cse0 v_ArrVal_1501) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1490) (select (select (store .cse2 .cse0 v_ArrVal_1502) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1496 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1495 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1491 (_ BitVec 32)) (v_ArrVal_1501 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1491)) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1495) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_21|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_21| v_ArrVal_1496) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1501) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))))) is different from false [2021-12-07 01:45:13,263 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:45:13,264 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 364 treesize of output 315 [2021-12-07 01:45:13,267 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:45:13,270 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 880 treesize of output 872 [2021-12-07 01:45:13,293 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:45:13,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 872 treesize of output 562 [2021-12-07 01:45:13,297 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:45:13,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 594 treesize of output 584 [2021-12-07 01:45:13,308 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 670 treesize of output 650 [2021-12-07 01:45:13,316 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 753 treesize of output 725 [2021-12-07 01:45:13,330 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 716 treesize of output 696 [2021-12-07 01:45:13,337 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 782 treesize of output 766 [2021-12-07 01:45:13,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 870 treesize of output 846 [2021-12-07 01:45:13,353 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 846 treesize of output 806 [2021-12-07 01:45:13,361 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 806 treesize of output 790 [2021-12-07 01:45:13,369 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 803 treesize of output 795 [2021-12-07 01:45:13,710 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:45:20,588 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:45:20,588 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:45:20,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826979971] [2021-12-07 01:45:20,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826979971] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:45:20,589 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:45:20,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2021-12-07 01:45:20,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732519492] [2021-12-07 01:45:20,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:45:20,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-07 01:45:20,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:45:20,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-07 01:45:20,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=415, Unknown=23, NotChecked=336, Total=870 [2021-12-07 01:45:20,590 INFO L87 Difference]: Start difference. First operand 300 states and 355 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:45:30,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:45:30,956 INFO L93 Difference]: Finished difference Result 491 states and 582 transitions. [2021-12-07 01:45:30,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-07 01:45:30,957 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-07 01:45:30,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:45:30,961 INFO L225 Difference]: With dead ends: 491 [2021-12-07 01:45:30,961 INFO L226 Difference]: Without dead ends: 491 [2021-12-07 01:45:30,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=207, Invalid=783, Unknown=30, NotChecked=462, Total=1482 [2021-12-07 01:45:30,962 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 415 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 2942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2014 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-07 01:45:30,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [415 Valid, 1404 Invalid, 2942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 876 Invalid, 0 Unknown, 2014 Unchecked, 2.7s Time] [2021-12-07 01:45:30,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2021-12-07 01:45:30,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 314. [2021-12-07 01:45:30,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 293 states have (on average 1.2696245733788396) internal successors, (372), 313 states have internal predecessors, (372), 0 states have call successors, (0), 0 states 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:45:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 372 transitions. [2021-12-07 01:45:30,966 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 372 transitions. Word has length 38 [2021-12-07 01:45:30,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:45:30,966 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 372 transitions. [2021-12-07 01:45:30,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:45:30,967 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 372 transitions. [2021-12-07 01:45:30,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-07 01:45:30,967 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:45:30,967 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:45:30,975 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2021-12-07 01:45:31,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:45:31,168 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:45:31,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:45:31,170 INFO L85 PathProgramCache]: Analyzing trace with hash -376181734, now seen corresponding path program 1 times [2021-12-07 01:45:31,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:45:31,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087973479] [2021-12-07 01:45:31,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:45:31,172 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:45:31,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:45:31,174 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:45:31,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-12-07 01:45:31,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:45:31,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-07 01:45:31,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:45:31,537 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:45:31,569 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-07 01:45:31,569 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 21 treesize of output 28 [2021-12-07 01:45:31,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, 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:45:31,681 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:45:31,681 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 43 treesize of output 44 [2021-12-07 01:45:31,764 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-12-07 01:45:31,764 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 42 treesize of output 65 [2021-12-07 01:45:31,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:31,857 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 48 treesize of output 35 [2021-12-07 01:45:32,126 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:45:32,126 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 54 [2021-12-07 01:45:32,388 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:45:32,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 60 [2021-12-07 01:45:32,505 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:45:32,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 54 [2021-12-07 01:45:32,547 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:45:32,547 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 59 treesize of output 54 [2021-12-07 01:45:32,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 26 [2021-12-07 01:45:32,927 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:45:32,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:45:33,166 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1580) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))))) is different from false [2021-12-07 01:45:33,184 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1577))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1580)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))))) (_ bv1 1)))) is different from false [2021-12-07 01:45:33,201 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1577))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1580)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))))))) (_ bv1 1)))) is different from false [2021-12-07 01:45:33,227 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1577 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1577))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1580)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))))))) (_ bv1 1)))) is different from false [2021-12-07 01:45:33,261 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1574 (_ BitVec 1)) (v_ArrVal_1577 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_24|)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_24| v_ArrVal_1574) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_24|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_24| v_ArrVal_1577))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1580)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))))))))))) is different from false [2021-12-07 01:45:33,291 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1574 (_ BitVec 1)) (v_ArrVal_1577 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_24|)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_24| v_ArrVal_1574) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_24|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_24| v_ArrVal_1577))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1580)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))))))) (_ bv1 1))))) is different from false [2021-12-07 01:45:33,354 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1573 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1574 (_ BitVec 1)) (v_ArrVal_1577 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_24|)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_24| v_ArrVal_1574) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1573))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_24|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_24| v_ArrVal_1577))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1580)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))))))))) (_ bv1 1))))) is different from false [2021-12-07 01:45:33,390 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1573 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1574 (_ BitVec 1)) (v_ArrVal_1577 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_24|)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_24| v_ArrVal_1574) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) v_ArrVal_1573))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_24|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_24| v_ArrVal_1577))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1580)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)))))))))))))))) (_ bv1 1))))) is different from false [2021-12-07 01:45:33,435 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:45:33,435 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 110 treesize of output 81 [2021-12-07 01:45:33,437 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:45:33,439 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 156 treesize of output 152 [2021-12-07 01:45:33,444 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 144 treesize of output 136 [2021-12-07 01:45:33,451 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:45:33,454 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 66 [2021-12-07 01:45:33,460 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 96 treesize of output 92 [2021-12-07 01:45:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-07 01:45:35,878 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:45:35,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087973479] [2021-12-07 01:45:35,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087973479] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:45:35,878 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:45:35,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2021-12-07 01:45:35,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549670969] [2021-12-07 01:45:35,878 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:45:35,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-07 01:45:35,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:45:35,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-07 01:45:35,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=370, Unknown=10, NotChecked=376, Total=870 [2021-12-07 01:45:35,879 INFO L87 Difference]: Start difference. First operand 314 states and 372 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:45:36,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:45:36,437 INFO L93 Difference]: Finished difference Result 332 states and 392 transitions. [2021-12-07 01:45:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-07 01:45:36,438 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-07 01:45:36,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:45:36,439 INFO L225 Difference]: With dead ends: 332 [2021-12-07 01:45:36,439 INFO L226 Difference]: Without dead ends: 332 [2021-12-07 01:45:36,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 13 SemanticMatches, 29 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=127, Invalid=401, Unknown=10, NotChecked=392, Total=930 [2021-12-07 01:45:36,440 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 43 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1125 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:45:36,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 1104 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 1125 Unchecked, 0.2s Time] [2021-12-07 01:45:36,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-12-07 01:45:36,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 302. [2021-12-07 01:45:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 281 states have (on average 1.2669039145907472) internal successors, (356), 301 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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:45:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 356 transitions. [2021-12-07 01:45:36,443 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 356 transitions. Word has length 38 [2021-12-07 01:45:36,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:45:36,443 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 356 transitions. [2021-12-07 01:45:36,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:45:36,444 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 356 transitions. [2021-12-07 01:45:36,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-07 01:45:36,444 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:45:36,444 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:45:36,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (36)] Ended with exit code 0 [2021-12-07 01:45:36,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:45:36,645 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:45:36,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:45:36,646 INFO L85 PathProgramCache]: Analyzing trace with hash 267303164, now seen corresponding path program 1 times [2021-12-07 01:45:36,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:45:36,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31887237] [2021-12-07 01:45:36,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:45:36,647 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:45:36,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:45:36,649 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:45:36,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-12-07 01:45:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:45:36,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-07 01:45:36,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:45:37,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:45:37,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:45:37,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:45:37,371 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:45:37,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31887237] [2021-12-07 01:45:37,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31887237] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:45:37,371 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:45:37,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-12-07 01:45:37,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793584648] [2021-12-07 01:45:37,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:45:37,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:45:37,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:45:37,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:45:37,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:45:37,372 INFO L87 Difference]: Start difference. First operand 302 states and 356 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:45:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:45:37,491 INFO L93 Difference]: Finished difference Result 332 states and 386 transitions. [2021-12-07 01:45:37,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:45:37,491 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-07 01:45:37,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:45:37,493 INFO L225 Difference]: With dead ends: 332 [2021-12-07 01:45:37,493 INFO L226 Difference]: Without dead ends: 304 [2021-12-07 01:45:37,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 33 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-07 01:45:37,493 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 2 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:45:37,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 236 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 105 Unchecked, 0.1s Time] [2021-12-07 01:45:37,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2021-12-07 01:45:37,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2021-12-07 01:45:37,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 283 states have (on average 1.265017667844523) internal successors, (358), 303 states have internal predecessors, (358), 0 states have call successors, (0), 0 states 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:45:37,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 358 transitions. [2021-12-07 01:45:37,497 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 358 transitions. Word has length 38 [2021-12-07 01:45:37,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:45:37,497 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 358 transitions. [2021-12-07 01:45:37,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:45:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 358 transitions. [2021-12-07 01:45:37,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-07 01:45:37,497 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:45:37,497 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:45:37,504 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (37)] Ended with exit code 0 [2021-12-07 01:45:37,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:45:37,698 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:45:37,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:45:37,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1093355750, now seen corresponding path program 1 times [2021-12-07 01:45:37,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:45:37,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308081735] [2021-12-07 01:45:37,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:45:37,701 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:45:37,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:45:37,704 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:45:37,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2021-12-07 01:45:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:45:37,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-07 01:45:37,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:45:37,930 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:45:37,951 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:45:37,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:37,971 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:45:38,016 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:45:38,017 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 18 treesize of output 18 [2021-12-07 01:45:38,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:38,048 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:45:38,053 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-07 01:45:38,144 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:45:38,145 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 29 treesize of output 30 [2021-12-07 01:45:38,149 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 20 treesize of output 22 [2021-12-07 01:45:38,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-07 01:45:38,240 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:45:38,264 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:45:38,279 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:45:38,280 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:45:38,309 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-07 01:45:38,316 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 16 treesize of output 18 [2021-12-07 01:45:38,366 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 20 treesize of output 8 [2021-12-07 01:45:38,399 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:45:38,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-07 01:45:38,499 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:45:38,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:45:38,599 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1693 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:45:38,607 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1693 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1693) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:45:38,619 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1693 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1691) |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1693) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:45:38,732 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1691 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc11#1.base_14| (_ BitVec 32)) (v_ArrVal_1693 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc11#1.base_14|))) (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1691) |v_ULTIMATE.start_main_#t~malloc11#1.base_14| v_ArrVal_1693) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-07 01:45:38,774 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1691 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc11#1.base_14| (_ BitVec 32)) (v_ArrVal_1693 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc11#1.base_14|))) (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1691) |v_ULTIMATE.start_main_#t~malloc11#1.base_14| v_ArrVal_1693) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))))) is different from false [2021-12-07 01:45:38,798 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-07 01:45:38,798 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 17 treesize of output 16 [2021-12-07 01:45:38,816 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1691 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc11#1.base_14| (_ BitVec 32)) (v_ArrVal_1693 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv2 32) (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1691) |v_ULTIMATE.start_main_#t~malloc11#1.base_14| v_ArrVal_1693) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc11#1.base_14|))) is different from false [2021-12-07 01:45:38,853 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1691 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc11#1.base_14| (_ BitVec 32)) (v_ArrVal_1693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1687 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1686 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1687) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1686) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1691) |v_ULTIMATE.start_main_#t~malloc11#1.base_14| v_ArrVal_1693) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc11#1.base_14|))) is different from false [2021-12-07 01:45:38,879 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1691 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc11#1.base_14| (_ BitVec 32)) (v_ArrVal_1693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1687 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1686 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv2 32) (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1687) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1686) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1691)) |v_ULTIMATE.start_main_#t~malloc11#1.base_14| v_ArrVal_1693) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc11#1.base_14|))) is different from false [2021-12-07 01:45:38,910 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:45:38,911 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 1 case distinctions, treesize of input 42 treesize of output 43 [2021-12-07 01:45:38,914 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 79 treesize of output 71 [2021-12-07 01:45:38,918 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 63 treesize of output 61 [2021-12-07 01:45:38,983 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_14| (_ BitVec 32))) (or (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc7#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (or .cse0 (forall ((v_ArrVal_1685 (_ BitVec 32)) (v_ArrVal_1691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1693 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1685)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1691) |v_ULTIMATE.start_main_#t~malloc11#1.base_14| v_ArrVal_1693) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))))) (or (forall ((v_ArrVal_1685 (_ BitVec 32)) (v_ArrVal_1691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1687 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32))) (not (= (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1685)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1687) v_arrayElimCell_271 v_ArrVal_1691) |v_ULTIMATE.start_main_#t~malloc11#1.base_14| v_ArrVal_1693) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32)))) (not .cse0)))) (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc11#1.base_14|))) is different from false [2021-12-07 01:45:39,227 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_28| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_14| (_ BitVec 32))) (or (let ((.cse0 (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_28|))) (and (or (forall ((v_ArrVal_1685 (_ BitVec 32)) (v_ArrVal_1691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1687 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_271 (_ BitVec 32))) (not (= (_ bv2 32) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1685)) |v_ULTIMATE.start_main_#t~malloc7#1.base_28| v_ArrVal_1687) v_arrayElimCell_271 v_ArrVal_1691) |v_ULTIMATE.start_main_#t~malloc11#1.base_14| v_ArrVal_1693) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (not .cse0)) (or .cse0 (forall ((v_ArrVal_1685 (_ BitVec 32)) (v_ArrVal_1691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1693 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1685)) |v_ULTIMATE.start_main_#t~malloc7#1.base_28| v_ArrVal_1691) |v_ULTIMATE.start_main_#t~malloc11#1.base_14| v_ArrVal_1693) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (= |c_ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc11#1.base_14|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_28|))))) is different from false [2021-12-07 01:45:42,049 INFO L354 Elim1Store]: treesize reduction 156, result has 26.8 percent of original size [2021-12-07 01:45:42,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 102 [2021-12-07 01:45:42,053 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:45:42,061 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-07 01:45:42,061 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 221 treesize of output 193 [2021-12-07 01:45:42,068 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:45:42,075 INFO L354 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2021-12-07 01:45:42,077 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 205 treesize of output 183 [2021-12-07 01:45:42,089 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 62 treesize of output 54 [2021-12-07 01:45:42,091 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 54 treesize of output 46 [2021-12-07 01:45:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-07 01:45:42,142 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:45:42,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308081735] [2021-12-07 01:45:42,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308081735] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:45:42,142 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:45:42,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 34 [2021-12-07 01:45:42,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426700557] [2021-12-07 01:45:42,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:45:42,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-07 01:45:42,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:45:42,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-07 01:45:42,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=443, Unknown=30, NotChecked=530, Total=1122 [2021-12-07 01:45:42,144 INFO L87 Difference]: Start difference. First operand 304 states and 358 transitions. Second operand has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:45:48,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:45:48,249 INFO L93 Difference]: Finished difference Result 722 states and 833 transitions. [2021-12-07 01:45:48,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-12-07 01:45:48,250 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 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:45:48,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:45:48,252 INFO L225 Difference]: With dead ends: 722 [2021-12-07 01:45:48,252 INFO L226 Difference]: Without dead ends: 722 [2021-12-07 01:45:48,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 60 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=520, Invalid=2137, Unknown=35, NotChecked=1090, Total=3782 [2021-12-07 01:45:48,254 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 576 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 3589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2202 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:45:48,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 1516 Invalid, 3589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1308 Invalid, 0 Unknown, 2202 Unchecked, 2.2s Time] [2021-12-07 01:45:48,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2021-12-07 01:45:48,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 317. [2021-12-07 01:45:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 296 states have (on average 1.2567567567567568) internal successors, (372), 316 states have internal predecessors, (372), 0 states have call successors, (0), 0 states 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:45:48,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 372 transitions. [2021-12-07 01:45:48,259 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 372 transitions. Word has length 38 [2021-12-07 01:45:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:45:48,259 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 372 transitions. [2021-12-07 01:45:48,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states 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:45:48,259 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 372 transitions. [2021-12-07 01:45:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-07 01:45:48,259 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:45:48,260 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:45:48,268 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (38)] Ended with exit code 0 [2021-12-07 01:45:48,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:45:48,461 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:45:48,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:45:48,462 INFO L85 PathProgramCache]: Analyzing trace with hash 946378740, now seen corresponding path program 1 times [2021-12-07 01:45:48,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:45:48,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834125030] [2021-12-07 01:45:48,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:45:48,464 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:45:48,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:45:48,466 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:45:48,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2021-12-07 01:45:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:45:48,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-07 01:45:48,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:45:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:45:48,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:45:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-07 01:45:51,047 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:45:51,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834125030] [2021-12-07 01:45:51,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834125030] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:45:51,047 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:45:51,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-12-07 01:45:51,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158580827] [2021-12-07 01:45:51,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:45:51,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 01:45:51,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:45:51,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 01:45:51,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-12-07 01:45:51,048 INFO L87 Difference]: Start difference. First operand 317 states and 372 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:45:51,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:45:51,166 INFO L93 Difference]: Finished difference Result 329 states and 383 transitions. [2021-12-07 01:45:51,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-07 01:45:51,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2021-12-07 01:45:51,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:45:51,167 INFO L225 Difference]: With dead ends: 329 [2021-12-07 01:45:51,168 INFO L226 Difference]: Without dead ends: 301 [2021-12-07 01:45:51,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 33 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-12-07 01:45:51,168 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 2 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-07 01:45:51,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 296 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 138 Unchecked, 0.1s Time] [2021-12-07 01:45:51,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-12-07 01:45:51,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2021-12-07 01:45:51,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 278 states have (on average 1.2697841726618706) internal successors, (353), 298 states have internal predecessors, (353), 0 states have call successors, (0), 0 states 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:45:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 353 transitions. [2021-12-07 01:45:51,171 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 353 transitions. Word has length 38 [2021-12-07 01:45:51,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:45:51,171 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 353 transitions. [2021-12-07 01:45:51,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:45:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 353 transitions. [2021-12-07 01:45:51,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-07 01:45:51,172 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:45:51,172 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, 1] [2021-12-07 01:45:51,179 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (39)] Ended with exit code 0 [2021-12-07 01:45:51,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:45:51,373 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:45:51,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:45:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1382957961, now seen corresponding path program 1 times [2021-12-07 01:45:51,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:45:51,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465281708] [2021-12-07 01:45:51,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:45:51,376 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:45:51,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:45:51,377 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:45:51,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2021-12-07 01:45:51,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:45:51,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-07 01:45:51,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:45:51,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-07 01:45:51,746 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:45:51,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:45:51,894 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:45:51,895 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 20 treesize of output 23 [2021-12-07 01:45:51,950 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:45:51,950 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:45:51,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465281708] [2021-12-07 01:45:51,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465281708] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:45:51,951 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:45:51,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2021-12-07 01:45:51,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382273061] [2021-12-07 01:45:51,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:45:51,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-07 01:45:51,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:45:51,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-07 01:45:51,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2021-12-07 01:45:51,952 INFO L87 Difference]: Start difference. First operand 299 states and 353 transitions. Second operand has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:45:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:45:53,050 INFO L93 Difference]: Finished difference Result 390 states and 448 transitions. [2021-12-07 01:45:53,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-07 01:45:53,050 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-07 01:45:53,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:45:53,052 INFO L225 Difference]: With dead ends: 390 [2021-12-07 01:45:53,052 INFO L226 Difference]: Without dead ends: 390 [2021-12-07 01:45:53,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=341, Unknown=0, NotChecked=0, Total=462 [2021-12-07 01:45:53,052 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 616 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:45:53,052 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [616 Valid, 512 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-07 01:45:53,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2021-12-07 01:45:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 349. [2021-12-07 01:45:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 328 states have (on average 1.2774390243902438) internal successors, (419), 348 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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:45:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 419 transitions. [2021-12-07 01:45:53,058 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 419 transitions. Word has length 40 [2021-12-07 01:45:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:45:53,058 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 419 transitions. [2021-12-07 01:45:53,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.285714285714286) internal successors, (60), 15 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:45:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 419 transitions. [2021-12-07 01:45:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-07 01:45:53,059 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:45:53,059 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, 1] [2021-12-07 01:45:53,067 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (40)] Ended with exit code 0 [2021-12-07 01:45:53,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:45:53,261 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:45:53,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:45:53,262 INFO L85 PathProgramCache]: Analyzing trace with hash 730040579, now seen corresponding path program 1 times [2021-12-07 01:45:53,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:45:53,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49886442] [2021-12-07 01:45:53,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:45:53,264 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:45:53,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:45:53,266 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:45:53,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2021-12-07 01:45:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:45:53,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-07 01:45:53,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:45:53,498 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:45:53,519 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:45:53,539 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:45:53,540 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 17 treesize of output 17 [2021-12-07 01:45:53,561 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:45:53,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:53,568 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:45:53,611 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:45:53,639 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:45:53,687 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:45:53,687 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 17 treesize of output 17 [2021-12-07 01:45:53,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:53,718 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:45:53,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-07 01:45:53,836 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:45:53,836 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 29 treesize of output 30 [2021-12-07 01:45:53,839 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 20 treesize of output 22 [2021-12-07 01:45:53,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-07 01:45:53,920 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:45:53,941 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:45:53,951 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:45:54,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-07 01:45:54,046 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:45:54,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:45:54,115 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1839 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1839) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-07 01:45:54,140 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1839 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1839) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-07 01:45:54,150 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1839 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1839) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))) is different from false [2021-12-07 01:45:54,167 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1839 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1836) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1835) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1839) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))) is different from false [2021-12-07 01:45:54,182 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1839 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int| .cse0 v_ArrVal_1836) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1835) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1839)) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))) is different from false [2021-12-07 01:45:54,201 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:45:54,202 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 38 treesize of output 39 [2021-12-07 01:45:54,205 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 70 treesize of output 62 [2021-12-07 01:45:54,211 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 29 treesize of output 27 [2021-12-07 01:45:54,282 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1839 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (_ BitVec 32))) (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc7#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (or (and (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1831)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1839) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not .cse0)) (and .cse0 (forall ((v_arrayElimCell_299 (_ BitVec 32)) (v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1831)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1836) v_arrayElimCell_299 v_ArrVal_1839) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2021-12-07 01:45:54,844 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1839 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_33| (_ BitVec 32))) (let ((.cse0 (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_33|))) (or (and (not .cse0) (= (_ bv2 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1831)) |v_ULTIMATE.start_main_#t~malloc7#1.base_33| v_ArrVal_1839) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (and (forall ((v_arrayElimCell_299 (_ BitVec 32)) (v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv2 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1831)) |v_ULTIMATE.start_main_#t~malloc7#1.base_33| v_ArrVal_1836) v_arrayElimCell_299 v_ArrVal_1839) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) .cse0) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_33|))))))) is different from false [2021-12-07 01:45:55,233 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1839 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (_ BitVec 32)) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_33| (_ BitVec 32))) (let ((.cse1 (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_33|))) (or (and (forall ((v_arrayElimCell_299 (_ BitVec 32)) (v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1830))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1831))) |v_ULTIMATE.start_main_#t~malloc7#1.base_33| v_ArrVal_1836) v_arrayElimCell_299 v_ArrVal_1839) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))) .cse1) (and (not .cse1) (= (_ bv2 32) (select (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1830))) (store .cse2 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1831))) |v_ULTIMATE.start_main_#t~malloc7#1.base_33| v_ArrVal_1839) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_33|))))))) is different from false [2021-12-07 01:45:55,456 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1839 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (_ BitVec 32)) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc7#1.base_33| (_ BitVec 32))) (let ((.cse0 (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_33|))) (or (and (not .cse0) (= (select (select (store (let ((.cse1 (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) v_ArrVal_1830))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1831))) |v_ULTIMATE.start_main_#t~malloc7#1.base_33| v_ArrVal_1839) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_33|)))) (and (forall ((v_arrayElimCell_299 (_ BitVec 32)) (v_ArrVal_1836 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (let ((.cse2 (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) v_ArrVal_1830))) (store .cse2 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1831))) |v_ULTIMATE.start_main_#t~malloc7#1.base_33| v_ArrVal_1836) v_arrayElimCell_299 v_ArrVal_1839) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv2 32))) .cse0)))) is different from false [2021-12-07 01:45:55,705 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-07 01:45:55,705 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 17 treesize of output 16 [2021-12-07 01:45:55,722 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1839 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1831 (_ BitVec 32)) (v_ArrVal_1830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1828 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_33| (_ BitVec 32))) (or (= (_ bv2 32) (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1828)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1830))) (store .cse0 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1831))) |v_ULTIMATE.start_main_#t~malloc7#1.base_33| v_ArrVal_1839) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv12 32) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= |c_ULTIMATE.start_main_~head~0#1.base| |v_ULTIMATE.start_main_#t~malloc7#1.base_33|))) is different from false [2021-12-07 01:45:55,893 INFO L354 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2021-12-07 01:45:55,893 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 47 [2021-12-07 01:45:55,897 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:45:55,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2021-12-07 01:45:55,902 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:45:55,904 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 21 treesize of output 13 [2021-12-07 01:45:55,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2021-12-07 01:45:55,952 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:45:55,952 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:45:55,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49886442] [2021-12-07 01:45:55,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49886442] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:45:55,953 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:45:55,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 32 [2021-12-07 01:45:55,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374582433] [2021-12-07 01:45:55,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:45:55,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-07 01:45:55,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:45:55,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-07 01:45:55,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=372, Unknown=21, NotChecked=490, Total=992 [2021-12-07 01:45:55,954 INFO L87 Difference]: Start difference. First operand 349 states and 419 transitions. Second operand has 32 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:45:58,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:45:58,592 INFO L93 Difference]: Finished difference Result 522 states and 620 transitions. [2021-12-07 01:45:58,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-07 01:45:58,593 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-07 01:45:58,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:45:58,595 INFO L225 Difference]: With dead ends: 522 [2021-12-07 01:45:58,595 INFO L226 Difference]: Without dead ends: 522 [2021-12-07 01:45:58,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=332, Invalid=1246, Unknown=22, NotChecked=850, Total=2450 [2021-12-07 01:45:58,596 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 697 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 3177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2191 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-07 01:45:58,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [697 Valid, 843 Invalid, 3177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 897 Invalid, 0 Unknown, 2191 Unchecked, 1.6s Time] [2021-12-07 01:45:58,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-12-07 01:45:58,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 349. [2021-12-07 01:45:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 328 states have (on average 1.274390243902439) internal successors, (418), 348 states have internal predecessors, (418), 0 states have call successors, (0), 0 states 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:45:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 418 transitions. [2021-12-07 01:45:58,600 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 418 transitions. Word has length 40 [2021-12-07 01:45:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:45:58,600 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 418 transitions. [2021-12-07 01:45:58,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:45:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 418 transitions. [2021-12-07 01:45:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-07 01:45:58,601 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:45:58,601 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, 1] [2021-12-07 01:45:58,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2021-12-07 01:45:58,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:45:58,803 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:45:58,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:45:58,804 INFO L85 PathProgramCache]: Analyzing trace with hash 343328011, now seen corresponding path program 1 times [2021-12-07 01:45:58,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:45:58,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76009298] [2021-12-07 01:45:58,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:45:58,806 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:45:58,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:45:58,808 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:45:58,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2021-12-07 01:45:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:45:59,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-07 01:45:59,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:45:59,045 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:45:59,069 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:45:59,074 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:45:59,129 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:45:59,130 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 17 treesize of output 17 [2021-12-07 01:45:59,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:59,159 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 21 treesize of output 20 [2021-12-07 01:45:59,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:59,168 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 21 treesize of output 20 [2021-12-07 01:45:59,259 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:45:59,260 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 37 [2021-12-07 01:45:59,263 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 20 treesize of output 22 [2021-12-07 01:45:59,386 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:45:59,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-07 01:45:59,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:59,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:45:59,430 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-07 01:45:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-07 01:45:59,437 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 7 treesize of output 3 [2021-12-07 01:45:59,452 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:45:59,452 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-07 01:45:59,487 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-07 01:45:59,487 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 18 treesize of output 18 [2021-12-07 01:45:59,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:59,546 INFO L354 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2021-12-07 01:45:59,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 36 [2021-12-07 01:45:59,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:59,561 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 16 treesize of output 18 [2021-12-07 01:45:59,732 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-07 01:45:59,732 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 63 [2021-12-07 01:45:59,739 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 20 treesize of output 22 [2021-12-07 01:45:59,753 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 20 treesize of output 12 [2021-12-07 01:45:59,916 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:45:59,917 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:45:59,918 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 17 treesize of output 10 [2021-12-07 01:45:59,920 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:45:59,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-07 01:45:59,922 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:45:59,923 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 25 treesize of output 14 [2021-12-07 01:45:59,988 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:45:59,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:46:00,183 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1925) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1924) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-07 01:46:00,199 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1924) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1925) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|))) is different from false [2021-12-07 01:46:00,226 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc11#1.base|)) |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1925) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1922) |c_ULTIMATE.start_main_#t~malloc11#1.base| v_ArrVal_1924) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-07 01:46:00,276 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc11#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc11#1.base_20|))))) (and (forall ((v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc11#1.base_20|)) |v_ULTIMATE.start_main_#t~malloc11#1.base_20| v_ArrVal_1925) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1922) |v_ULTIMATE.start_main_#t~malloc11#1.base_20| v_ArrVal_1924) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:46:00,290 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:46:00,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2021-12-07 01:46:00,302 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2021-12-07 01:46:00,332 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| (select v_arrayElimArr_20 (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|))))))) (and (forall ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1922) (select v_arrayElimArr_20 (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1924) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_20) (select v_arrayElimArr_20 (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1925) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2021-12-07 01:46:00,342 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 32 treesize of output 24 [2021-12-07 01:46:00,372 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 32 treesize of output 24 [2021-12-07 01:46:00,404 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 32 treesize of output 24 [2021-12-07 01:46:00,435 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| (select v_arrayElimArr_20 (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|))))))) (and (forall ((v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_arrayElimArr_20) (select v_arrayElimArr_20 (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1925) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1922) (select v_arrayElimArr_20 (bvadd (_ bv8 32) |ULTIMATE.start_main_~x~0#1.offset|)) v_ArrVal_1924) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:46:00,454 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-12-07 01:46:00,454 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 24 treesize of output 23 [2021-12-07 01:46:00,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 31 treesize of output 23 [2021-12-07 01:46:00,498 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.offset_116| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| (select v_arrayElimArr_20 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~x~0#1.offset_116|))) (and (forall ((v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_arrayElimArr_20) (select v_arrayElimArr_20 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~x~0#1.offset_116|)) v_ArrVal_1925) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1922) (select v_arrayElimArr_20 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~x~0#1.offset_116|)) v_ArrVal_1924) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:46:00,517 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 31 treesize of output 23 [2021-12-07 01:46:00,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 37 treesize of output 29 [2021-12-07 01:46:00,593 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.offset_116| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| (select v_arrayElimArr_20 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~x~0#1.offset_116|))) (and (forall ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1915))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_arrayElimArr_20)) (select v_arrayElimArr_20 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~x~0#1.offset_116|)) v_ArrVal_1925) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1916) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1915) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1922) (select v_arrayElimArr_20 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~x~0#1.offset_116|)) v_ArrVal_1924) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:46:00,620 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 37 [2021-12-07 01:46:00,648 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.offset_116| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1915))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_arrayElimArr_20)) (select v_arrayElimArr_20 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~x~0#1.offset_116|)) v_ArrVal_1925) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1916) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1915) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1922)) (select v_arrayElimArr_20 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~x~0#1.offset_116|)) v_ArrVal_1924) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= |c_ULTIMATE.start_main_~x~0#1.base| (select v_arrayElimArr_20 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~x~0#1.offset_116|))))) is different from false [2021-12-07 01:46:00,671 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 37 [2021-12-07 01:46:00,737 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 53 treesize of output 45 [2021-12-07 01:46:00,795 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.offset_116| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| (select v_arrayElimArr_20 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~x~0#1.offset_116|))) (and (forall ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1915))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_arrayElimArr_20)) (select v_arrayElimArr_20 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~x~0#1.offset_116|)) v_ArrVal_1925) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1911 (_ BitVec 32)) (v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1911)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1916) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc7#1.base|)) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_1915) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1922) (select v_arrayElimArr_20 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~x~0#1.offset_116|)) v_ArrVal_1924) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-07 01:46:00,865 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 53 treesize of output 45 [2021-12-07 01:46:00,994 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 53 treesize of output 45 [2021-12-07 01:46:01,070 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 53 treesize of output 45 [2021-12-07 01:46:01,147 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_36| (_ BitVec 32))) (or (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.offset_116| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~x~0#1.base| (select v_arrayElimArr_20 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~x~0#1.offset_116|))) (and (forall ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1911 (_ BitVec 32)) (v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1911)) |v_ULTIMATE.start_main_#t~malloc7#1.base_36| v_ArrVal_1916) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_36|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_36| v_ArrVal_1915) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1922) (select v_arrayElimArr_20 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~x~0#1.offset_116|)) v_ArrVal_1924) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_36|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_36| v_ArrVal_1915))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_arrayElimArr_20)) (select v_arrayElimArr_20 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~x~0#1.offset_116|)) v_ArrVal_1925) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|))))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_36|))))))) is different from false [2021-12-07 01:46:01,223 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 53 treesize of output 45 [2021-12-07 01:46:01,333 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 53 treesize of output 45 [2021-12-07 01:46:01,430 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_36| (_ BitVec 32)) (v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.offset_116| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_36|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_36| v_ArrVal_1915))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_arrayElimArr_20)) (select v_arrayElimArr_20 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~x~0#1.offset_116|)) v_ArrVal_1925) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1915 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1911 (_ BitVec 32)) (v_ArrVal_1922 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_1911)) |v_ULTIMATE.start_main_#t~malloc7#1.base_36| v_ArrVal_1916) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_36|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_36| v_ArrVal_1915) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) v_ArrVal_1922) (select v_arrayElimArr_20 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~x~0#1.offset_116|)) v_ArrVal_1924) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~head~0#1.offset|)) |c_ULTIMATE.start_main_~head~0#1.offset|))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_20 (bvadd (_ bv8 32) |v_ULTIMATE.start_main_~x~0#1.offset_116|))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_36|))))))) is different from false [2021-12-07 01:46:01,529 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-07 01:46:01,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 111 treesize of output 117 [2021-12-07 01:46:01,601 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-07 01:46:01,601 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 96 [2021-12-07 01:46:01,606 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:46:01,617 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 01:46:01,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 342 treesize of output 292 [2021-12-07 01:46:01,625 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:46:01,637 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-07 01:46:01,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 374 treesize of output 352 [2021-12-07 01:46:01,662 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:46:01,663 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 359 treesize of output 351 [2021-12-07 01:46:01,678 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 150 treesize of output 146 [2021-12-07 01:46:01,683 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 146 treesize of output 142 [2021-12-07 01:46:01,689 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 142 treesize of output 138 [2021-12-07 01:46:01,694 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-07 01:46:01,695 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 138 treesize of output 118 [2021-12-07 01:46:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-07 01:46:01,791 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:46:01,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76009298] [2021-12-07 01:46:01,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76009298] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:46:01,791 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:46:01,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 33 [2021-12-07 01:46:01,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93972175] [2021-12-07 01:46:01,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:46:01,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-07 01:46:01,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:46:01,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-07 01:46:01,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=354, Unknown=12, NotChecked=588, Total=1056 [2021-12-07 01:46:01,792 INFO L87 Difference]: Start difference. First operand 349 states and 418 transitions. Second operand has 33 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:46:04,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:46:04,617 INFO L93 Difference]: Finished difference Result 432 states and 505 transitions. [2021-12-07 01:46:04,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-07 01:46:04,618 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-07 01:46:04,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:46:04,619 INFO L225 Difference]: With dead ends: 432 [2021-12-07 01:46:04,619 INFO L226 Difference]: Without dead ends: 432 [2021-12-07 01:46:04,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 45 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=250, Invalid=903, Unknown=17, NotChecked=900, Total=2070 [2021-12-07 01:46:04,620 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 347 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2083 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-07 01:46:04,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 996 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 736 Invalid, 0 Unknown, 2083 Unchecked, 1.5s Time] [2021-12-07 01:46:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-12-07 01:46:04,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 343. [2021-12-07 01:46:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 322 states have (on average 1.2763975155279503) internal successors, (411), 342 states have internal predecessors, (411), 0 states have call successors, (0), 0 states 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:46:04,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 411 transitions. [2021-12-07 01:46:04,624 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 411 transitions. Word has length 40 [2021-12-07 01:46:04,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:46:04,624 INFO L470 AbstractCegarLoop]: Abstraction has 343 states and 411 transitions. [2021-12-07 01:46:04,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:46:04,625 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 411 transitions. [2021-12-07 01:46:04,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-07 01:46:04,625 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:46:04,625 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:46:04,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2021-12-07 01:46:04,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:46:04,826 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 68 more)] === [2021-12-07 01:46:04,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:46:04,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1071076886, now seen corresponding path program 1 times [2021-12-07 01:46:04,826 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:46:04,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525351375] [2021-12-07 01:46:04,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:46:04,827 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:46:04,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:46:04,827 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:46:04,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5256e11a-e4f2-4c03-934f-293c43069cf5/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2021-12-07 01:46:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:46:05,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-07 01:46:05,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:46:05,013 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:46:05,057 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-07 01:46:05,057 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 20 treesize of output 27 [2021-12-07 01:46:05,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-07 01:46:05,206 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:46:05,207 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 37 treesize of output 38 [2021-12-07 01:46:05,331 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:46:05,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 38 [2021-12-07 01:46:05,377 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:46:05,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2021-12-07 01:46:05,419 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-07 01:46:05,419 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 38 treesize of output 39 [2021-12-07 01:46:05,635 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 39 treesize of output 27 [2021-12-07 01:46:05,741 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:46:05,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:46:05,826 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1991) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))))))))) (_ bv1 1)))) is different from false [2021-12-07 01:46:05,998 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1988))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1991)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))))))))))))) (_ bv1 1)))) is different from false [2021-12-07 01:46:06,012 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1991 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1988))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1991)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))))))))))))))))))) (_ bv1 1)))) is different from false [2021-12-07 01:46:06,030 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:46:06,030 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 61 treesize of output 54 [2021-12-07 01:46:06,042 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:46:06,042 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 236 treesize of output 223 [2021-12-07 01:46:06,057 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-07 01:46:06,058 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 208 treesize of output 206 [2021-12-07 01:46:06,063 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 198 treesize of output 194