./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d185ad037455b90cde67f589b43e0c5f37430bb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d185ad037455b90cde67f589b43e0c5f37430bb ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:03:00,528 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:03:00,529 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:03:00,537 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:03:00,537 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:03:00,538 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:03:00,539 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:03:00,540 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:03:00,541 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:03:00,541 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:03:00,542 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:03:00,542 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:03:00,543 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:03:00,543 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:03:00,544 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:03:00,545 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:03:00,545 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:03:00,546 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:03:00,547 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:03:00,548 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:03:00,549 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:03:00,550 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:03:00,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:03:00,551 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:03:00,551 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:03:00,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:03:00,552 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:03:00,553 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:03:00,553 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:03:00,554 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:03:00,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:03:00,555 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:03:00,555 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:03:00,555 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:03:00,556 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:03:00,556 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:03:00,556 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 05:03:00,565 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:03:00,565 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:03:00,566 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:03:00,566 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:03:00,566 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 05:03:00,566 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 05:03:00,567 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 05:03:00,567 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 05:03:00,567 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 05:03:00,567 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 05:03:00,567 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 05:03:00,567 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 05:03:00,567 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 05:03:00,568 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:03:00,568 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:03:00,568 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:03:00,568 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:03:00,568 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:03:00,569 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:03:00,569 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:03:00,569 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:03:00,569 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:03:00,569 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:03:00,569 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:03:00,569 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:03:00,569 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:03:00,569 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:03:00,569 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:03:00,569 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:03:00,570 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:03:00,570 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:03:00,570 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:03:00,570 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:03:00,570 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 05:03:00,570 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:03:00,570 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:03:00,570 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 05:03:00,570 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 3d185ad037455b90cde67f589b43e0c5f37430bb [2018-11-23 05:03:00,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:03:00,604 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:03:00,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:03:00,608 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:03:00,608 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:03:00,609 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 05:03:00,642 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/data/6af9dcc14/280ce94976eb4114b5f4bbea6c9e5c5f/FLAG25bb04bfb [2018-11-23 05:03:00,995 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:03:00,995 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 05:03:01,002 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/data/6af9dcc14/280ce94976eb4114b5f4bbea6c9e5c5f/FLAG25bb04bfb [2018-11-23 05:03:01,023 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/data/6af9dcc14/280ce94976eb4114b5f4bbea6c9e5c5f [2018-11-23 05:03:01,025 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:03:01,025 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:03:01,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:03:01,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:03:01,029 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:03:01,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:03:01" (1/1) ... [2018-11-23 05:03:01,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@271ec2fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:01, skipping insertion in model container [2018-11-23 05:03:01,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:03:01" (1/1) ... [2018-11-23 05:03:01,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:03:01,062 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:03:01,248 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:03:01,255 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:03:01,331 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:03:01,363 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:03:01,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:01 WrapperNode [2018-11-23 05:03:01,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:03:01,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:03:01,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:03:01,364 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:03:01,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:01" (1/1) ... [2018-11-23 05:03:01,381 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:01" (1/1) ... [2018-11-23 05:03:01,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:03:01,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:03:01,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:03:01,386 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:03:01,392 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:01" (1/1) ... [2018-11-23 05:03:01,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:01" (1/1) ... [2018-11-23 05:03:01,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:01" (1/1) ... [2018-11-23 05:03:01,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:01" (1/1) ... [2018-11-23 05:03:01,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:01" (1/1) ... [2018-11-23 05:03:01,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:01" (1/1) ... [2018-11-23 05:03:01,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:01" (1/1) ... [2018-11-23 05:03:01,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:03:01,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:03:01,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:03:01,411 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:03:01,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:03:01,455 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-11-23 05:03:01,455 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-11-23 05:03:01,455 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 05:03:01,455 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 05:03:01,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:03:01,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:03:01,456 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-11-23 05:03:01,456 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-11-23 05:03:01,456 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 05:03:01,456 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 05:03:01,456 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 05:03:01,456 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 05:03:01,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 05:03:01,456 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 05:03:01,456 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 05:03:01,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:03:01,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:03:01,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:03:01,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:03:01,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 05:03:01,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 05:03:01,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:03:01,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:03:01,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:03:01,718 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:03:01,718 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 05:03:01,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:03:01 BoogieIcfgContainer [2018-11-23 05:03:01,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:03:01,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:03:01,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:03:01,721 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:03:01,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:03:01" (1/3) ... [2018-11-23 05:03:01,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e87a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:03:01, skipping insertion in model container [2018-11-23 05:03:01,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:01" (2/3) ... [2018-11-23 05:03:01,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e87a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:03:01, skipping insertion in model container [2018-11-23 05:03:01,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:03:01" (3/3) ... [2018-11-23 05:03:01,724 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 05:03:01,729 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:03:01,734 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:03:01,743 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:03:01,763 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:03:01,763 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:03:01,763 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:03:01,763 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:03:01,764 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:03:01,764 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:03:01,764 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:03:01,764 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:03:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-11-23 05:03:01,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:03:01,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:03:01,781 INFO L402 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] [2018-11-23 05:03:01,783 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:03:01,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:03:01,787 INFO L82 PathProgramCache]: Analyzing trace with hash -43549588, now seen corresponding path program 1 times [2018-11-23 05:03:01,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:03:01,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:03:01,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:03:01,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:03:01,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:03:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:03:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:03:01,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:03:01,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:03:01,911 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:03:01,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 05:03:01,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:03:01,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:03:01,924 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-11-23 05:03:01,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:03:01,990 INFO L93 Difference]: Finished difference Result 100 states and 135 transitions. [2018-11-23 05:03:01,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:03:01,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 05:03:01,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:03:01,999 INFO L225 Difference]: With dead ends: 100 [2018-11-23 05:03:01,999 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 05:03:02,002 INFO L631 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 [2018-11-23 05:03:02,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 05:03:02,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-11-23 05:03:02,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 05:03:02,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 05:03:02,035 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 25 [2018-11-23 05:03:02,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:03:02,036 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 05:03:02,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 05:03:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 05:03:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 05:03:02,036 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:03:02,036 INFO L402 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] [2018-11-23 05:03:02,037 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:03:02,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:03:02,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1490311690, now seen corresponding path program 1 times [2018-11-23 05:03:02,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:03:02,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:03:02,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:03:02,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:03:02,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:03:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:03:02,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:03:02,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:03:02,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:03:02,087 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:03:02,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:03:02,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:03:02,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:03:02,089 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-11-23 05:03:02,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:03:02,125 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-23 05:03:02,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:03:02,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-23 05:03:02,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:03:02,126 INFO L225 Difference]: With dead ends: 73 [2018-11-23 05:03:02,127 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 05:03:02,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:03:02,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 05:03:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-11-23 05:03:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 05:03:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-23 05:03:02,133 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 33 [2018-11-23 05:03:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:03:02,133 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-23 05:03:02,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:03:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-23 05:03:02,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 05:03:02,134 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:03:02,134 INFO L402 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] [2018-11-23 05:03:02,135 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:03:02,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:03:02,135 INFO L82 PathProgramCache]: Analyzing trace with hash 247580725, now seen corresponding path program 1 times [2018-11-23 05:03:02,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:03:02,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:03:02,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:03:02,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:03:02,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:03:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:03:02,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:03:02,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:03:02,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:03:02,194 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-11-23 05:03:02,195 INFO L202 CegarAbsIntRunner]: [0], [7], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [63], [64], [79], [85], [87], [89], [91], [95], [96], [100], [107], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-11-23 05:03:02,218 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:03:02,218 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:03:02,387 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:03:02,389 INFO L272 AbstractInterpreter]: Visited 27 different actions 50 times. Merged at 7 different actions 11 times. Never widened. Performed 446 root evaluator evaluations with a maximum evaluation depth of 4. Performed 446 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-11-23 05:03:02,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:03:02,394 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:03:02,455 INFO L227 lantSequenceWeakener]: Weakened 15 states. On average, predicates are now at 82.99% of their original sizes. [2018-11-23 05:03:02,455 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:03:02,589 INFO L415 sIntCurrentIteration]: We unified 41 AI predicates to 41 [2018-11-23 05:03:02,589 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:03:02,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:03:02,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [5] total 20 [2018-11-23 05:03:02,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:03:02,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 05:03:02,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 05:03:02,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-11-23 05:03:02,591 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 17 states. [2018-11-23 05:03:03,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:03:03,589 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2018-11-23 05:03:03,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 05:03:03,589 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-11-23 05:03:03,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:03:03,590 INFO L225 Difference]: With dead ends: 80 [2018-11-23 05:03:03,590 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 05:03:03,591 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-11-23 05:03:03,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 05:03:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2018-11-23 05:03:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 05:03:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-11-23 05:03:03,600 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 42 [2018-11-23 05:03:03,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:03:03,601 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-11-23 05:03:03,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 05:03:03,601 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-23 05:03:03,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 05:03:03,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:03:03,602 INFO L402 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, 1] [2018-11-23 05:03:03,603 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:03:03,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:03:03,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1197629826, now seen corresponding path program 1 times [2018-11-23 05:03:03,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:03:03,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:03:03,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:03:03,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:03:03,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:03:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:03:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 05:03:03,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:03:03,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:03:03,679 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-11-23 05:03:03,679 INFO L202 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [63], [64], [79], [85], [87], [89], [91], [95], [96], [100], [107], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-11-23 05:03:03,681 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:03:03,681 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:03:03,731 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:03:03,731 INFO L272 AbstractInterpreter]: Visited 37 different actions 87 times. Merged at 14 different actions 22 times. Never widened. Performed 712 root evaluator evaluations with a maximum evaluation depth of 4. Performed 712 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 5 different actions. Largest state had 27 variables. [2018-11-23 05:03:03,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:03:03,732 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:03:03,761 INFO L227 lantSequenceWeakener]: Weakened 25 states. On average, predicates are now at 88.97% of their original sizes. [2018-11-23 05:03:03,762 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:03:03,860 INFO L415 sIntCurrentIteration]: We unified 42 AI predicates to 42 [2018-11-23 05:03:03,860 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:03:03,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:03:03,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [5] total 20 [2018-11-23 05:03:03,861 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:03:03,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 05:03:03,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 05:03:03,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-11-23 05:03:03,862 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 17 states. [2018-11-23 05:03:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:03:04,857 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2018-11-23 05:03:04,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 05:03:04,857 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2018-11-23 05:03:04,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:03:04,858 INFO L225 Difference]: With dead ends: 77 [2018-11-23 05:03:04,858 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 05:03:04,858 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2018-11-23 05:03:04,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 05:03:04,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-11-23 05:03:04,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 05:03:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-11-23 05:03:04,865 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 43 [2018-11-23 05:03:04,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:03:04,865 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-11-23 05:03:04,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 05:03:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-11-23 05:03:04,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 05:03:04,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:03:04,866 INFO L402 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, 1, 1] [2018-11-23 05:03:04,867 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:03:04,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:03:04,867 INFO L82 PathProgramCache]: Analyzing trace with hash 886597805, now seen corresponding path program 1 times [2018-11-23 05:03:04,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:03:04,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:03:04,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:03:04,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:03:04,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:03:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:03:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:03:04,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:03:04,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:03:04,927 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-11-23 05:03:04,927 INFO L202 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [63], [64], [79], [85], [87], [89], [91], [95], [96], [100], [107], [109], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-11-23 05:03:04,929 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:03:04,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:03:04,971 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 05:03:04,971 INFO L272 AbstractInterpreter]: Visited 44 different actions 96 times. Merged at 15 different actions 23 times. Never widened. Performed 744 root evaluator evaluations with a maximum evaluation depth of 4. Performed 744 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 6 different actions. Largest state had 27 variables. [2018-11-23 05:03:04,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:03:04,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 05:03:04,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:03:04,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:03:04,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:03:04,998 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 05:03:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:03:05,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:03:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:03:05,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:03:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:03:05,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 05:03:05,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2018-11-23 05:03:05,199 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 05:03:05,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 05:03:05,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 05:03:05,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:03:05,200 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 8 states. [2018-11-23 05:03:05,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:03:05,309 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2018-11-23 05:03:05,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:03:05,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2018-11-23 05:03:05,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:03:05,312 INFO L225 Difference]: With dead ends: 115 [2018-11-23 05:03:05,312 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 05:03:05,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:03:05,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 05:03:05,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 65. [2018-11-23 05:03:05,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 05:03:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2018-11-23 05:03:05,322 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 44 [2018-11-23 05:03:05,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:03:05,322 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2018-11-23 05:03:05,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 05:03:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2018-11-23 05:03:05,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 05:03:05,325 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:03:05,325 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:03:05,325 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:03:05,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:03:05,325 INFO L82 PathProgramCache]: Analyzing trace with hash 569673156, now seen corresponding path program 2 times [2018-11-23 05:03:05,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:03:05,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:03:05,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:03:05,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:03:05,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:03:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:03:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:03:06,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:03:06,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:03:06,270 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 05:03:06,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 05:03:06,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:03:06,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:03:06,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:03:06,277 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 05:03:06,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 05:03:06,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:03:06,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:03:06,415 INFO L478 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 [2018-11-23 05:03:06,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:06,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:06,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 05:03:06,451 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 05:03:06,452 INFO L478 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 8 treesize of output 7 [2018-11-23 05:03:06,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:06,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:06,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:06,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-11-23 05:03:06,542 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-23 05:03:06,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 05:03:06,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:06,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:06,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:06,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2018-11-23 05:03:06,642 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:06,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:06,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:06,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-11-23 05:03:07,540 WARN L180 SmtUtils]: Spent 427.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 05:03:07,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:03:07,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:03:07,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 05:03:07,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:07,557 INFO L478 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 22 treesize of output 23 [2018-11-23 05:03:07,558 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 05:03:07,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-11-23 05:03:07,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:07,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:07,567 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:07,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:07,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:18 [2018-11-23 05:03:07,608 INFO L478 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 11 treesize of output 8 [2018-11-23 05:03:07,610 INFO L478 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 8 treesize of output 7 [2018-11-23 05:03:07,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:07,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:07,623 INFO L478 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 23 treesize of output 28 [2018-11-23 05:03:07,625 INFO L478 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 12 treesize of output 1 [2018-11-23 05:03:07,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:07,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:07,636 INFO L478 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 11 treesize of output 8 [2018-11-23 05:03:07,637 INFO L478 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 8 treesize of output 7 [2018-11-23 05:03:07,638 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:07,639 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:07,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:07,645 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:52, output treesize:30 [2018-11-23 05:03:07,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:03:07,987 INFO L478 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 0 case distinctions, treesize of input 143 treesize of output 147 [2018-11-23 05:03:07,990 INFO L478 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 36 treesize of output 1 [2018-11-23 05:03:07,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:08,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:08,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:03:08,033 INFO L478 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 86 treesize of output 87 [2018-11-23 05:03:08,035 INFO L478 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 36 treesize of output 1 [2018-11-23 05:03:08,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:08,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:08,050 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:03:08,051 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:03:08,051 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2018-11-23 05:03:08,054 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:03:08,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 46 treesize of output 44 [2018-11-23 05:03:08,055 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:08,058 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:08,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:08,064 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:156, output treesize:45 [2018-11-23 05:03:10,171 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int) (sll_update_at_~data Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset sll_update_at_~data))) (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.offset)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.offset| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2018-11-23 05:03:10,189 INFO L478 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 0 case distinctions, treesize of input 47 treesize of output 40 [2018-11-23 05:03:10,193 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:03:10,194 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:03:10,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2018-11-23 05:03:10,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,221 INFO L478 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 35 treesize of output 42 [2018-11-23 05:03:10,223 INFO L478 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 8 treesize of output 7 [2018-11-23 05:03:10,224 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,228 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,240 INFO L478 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 0 case distinctions, treesize of input 46 treesize of output 39 [2018-11-23 05:03:10,243 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:03:10,244 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:03:10,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-11-23 05:03:10,246 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,251 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,259 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:89, output treesize:49 [2018-11-23 05:03:10,660 INFO L478 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 70 treesize of output 68 [2018-11-23 05:03:10,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 60 treesize of output 50 [2018-11-23 05:03:10,664 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:10,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 64 treesize of output 60 [2018-11-23 05:03:10,679 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:10,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 60 treesize of output 54 [2018-11-23 05:03:10,695 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:10,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 05:03:10,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 62 [2018-11-23 05:03:10,736 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2018-11-23 05:03:10,736 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,754 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-11-23 05:03:10,755 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,771 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-11-23 05:03:10,771 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,781 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-11-23 05:03:10,786 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-23 05:03:10,786 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,795 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-23 05:03:10,795 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,802 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 38 treesize of output 32 [2018-11-23 05:03:10,822 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2018-11-23 05:03:10,822 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,827 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2018-11-23 05:03:10,846 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2018-11-23 05:03:10,847 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,868 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-23 05:03:10,868 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,888 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 05:03:10,888 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:10,903 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 05:03:10,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 05:03:10,926 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 7 variables, input treesize:97, output treesize:37 [2018-11-23 05:03:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2018-11-23 05:03:11,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:03:11,533 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:11,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:11,565 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:11,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:11,586 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:11,592 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:11,606 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:11,610 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:11,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2018-11-23 05:03:11,619 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:135, output treesize:83 [2018-11-23 05:03:11,800 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-11-23 05:03:33,560 WARN L180 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-11-23 05:03:33,568 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2018-11-23 05:03:33,584 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-11-23 05:03:33,801 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:03:33,801 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:217) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 05:03:33,804 INFO L168 Benchmark]: Toolchain (without parser) took 32779.43 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 326.1 MB). Free memory was 956.4 MB in the beginning and 1.0 GB in the end (delta: -55.2 MB). Peak memory consumption was 270.9 MB. Max. memory is 11.5 GB. [2018-11-23 05:03:33,805 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:03:33,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:03:33,806 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:03:33,806 INFO L168 Benchmark]: Boogie Preprocessor took 24.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:03:33,806 INFO L168 Benchmark]: RCFGBuilder took 308.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:03:33,807 INFO L168 Benchmark]: TraceAbstraction took 32084.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.0 MB). Peak memory consumption was 267.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:03:33,809 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 337.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 308.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32084.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 93.0 MB). Peak memory consumption was 267.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 05:03:35,269 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:03:35,270 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:03:35,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:03:35,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:03:35,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:03:35,279 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:03:35,281 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:03:35,282 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:03:35,283 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:03:35,284 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:03:35,284 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:03:35,285 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:03:35,286 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:03:35,287 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:03:35,287 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:03:35,288 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:03:35,290 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:03:35,291 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:03:35,293 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:03:35,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:03:35,295 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:03:35,296 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:03:35,297 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:03:35,297 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:03:35,298 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:03:35,298 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:03:35,299 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:03:35,299 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:03:35,301 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:03:35,301 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:03:35,301 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:03:35,302 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:03:35,302 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:03:35,303 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:03:35,303 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:03:35,303 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 05:03:35,315 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:03:35,315 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:03:35,316 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:03:35,316 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:03:35,316 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 05:03:35,316 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 05:03:35,316 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 05:03:35,316 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 05:03:35,317 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 05:03:35,317 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 05:03:35,317 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:03:35,317 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:03:35,317 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:03:35,318 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:03:35,318 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:03:35,318 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:03:35,318 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:03:35,318 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 05:03:35,318 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 05:03:35,318 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:03:35,319 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:03:35,319 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:03:35,319 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:03:35,319 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:03:35,319 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:03:35,319 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:03:35,319 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:03:35,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:03:35,319 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:03:35,320 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:03:35,320 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:03:35,320 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 05:03:35,320 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:03:35,320 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 05:03:35,322 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 05:03:35,322 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 3d185ad037455b90cde67f589b43e0c5f37430bb [2018-11-23 05:03:35,355 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:03:35,364 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:03:35,366 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:03:35,367 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:03:35,368 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:03:35,368 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 05:03:35,408 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/data/6e25bcf8c/7e64276a24254f78b7579efc3f9e966f/FLAG8b97ed1d8 [2018-11-23 05:03:35,774 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:03:35,774 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/sv-benchmarks/c/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 05:03:35,782 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/data/6e25bcf8c/7e64276a24254f78b7579efc3f9e966f/FLAG8b97ed1d8 [2018-11-23 05:03:36,166 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/data/6e25bcf8c/7e64276a24254f78b7579efc3f9e966f [2018-11-23 05:03:36,168 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:03:36,169 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:03:36,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:03:36,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:03:36,173 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:03:36,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:03:36" (1/1) ... [2018-11-23 05:03:36,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d28127a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:36, skipping insertion in model container [2018-11-23 05:03:36,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:03:36" (1/1) ... [2018-11-23 05:03:36,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:03:36,211 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:03:36,457 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:03:36,469 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:03:36,513 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:03:36,598 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:03:36,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:36 WrapperNode [2018-11-23 05:03:36,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:03:36,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:03:36,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:03:36,600 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:03:36,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:36" (1/1) ... [2018-11-23 05:03:36,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:36" (1/1) ... [2018-11-23 05:03:36,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:03:36,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:03:36,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:03:36,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:03:36,629 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:36" (1/1) ... [2018-11-23 05:03:36,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:36" (1/1) ... [2018-11-23 05:03:36,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:36" (1/1) ... [2018-11-23 05:03:36,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:36" (1/1) ... [2018-11-23 05:03:36,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:36" (1/1) ... [2018-11-23 05:03:36,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:36" (1/1) ... [2018-11-23 05:03:36,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:36" (1/1) ... [2018-11-23 05:03:36,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:03:36,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:03:36,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:03:36,648 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:03:36,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:03:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-11-23 05:03:36,687 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-11-23 05:03:36,687 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 05:03:36,687 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 05:03:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:03:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 05:03:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-11-23 05:03:36,688 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-11-23 05:03:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 05:03:36,688 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 05:03:36,688 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 05:03:36,689 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 05:03:36,689 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 05:03:36,689 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 05:03:36,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:03:36,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:03:36,689 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:03:36,689 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:03:36,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 05:03:36,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 05:03:36,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:03:36,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 05:03:36,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:03:36,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:03:36,956 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:03:36,957 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 05:03:36,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:03:36 BoogieIcfgContainer [2018-11-23 05:03:36,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:03:36,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:03:36,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:03:36,961 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:03:36,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:03:36" (1/3) ... [2018-11-23 05:03:36,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f385373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:03:36, skipping insertion in model container [2018-11-23 05:03:36,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:03:36" (2/3) ... [2018-11-23 05:03:36,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f385373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:03:36, skipping insertion in model container [2018-11-23 05:03:36,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:03:36" (3/3) ... [2018-11-23 05:03:36,964 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 05:03:36,972 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:03:36,979 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:03:36,989 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:03:37,008 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:03:37,009 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:03:37,009 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:03:37,009 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:03:37,009 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:03:37,009 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:03:37,009 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:03:37,009 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:03:37,009 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:03:37,020 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-23 05:03:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 05:03:37,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:03:37,025 INFO L402 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] [2018-11-23 05:03:37,026 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:03:37,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:03:37,030 INFO L82 PathProgramCache]: Analyzing trace with hash 197480979, now seen corresponding path program 1 times [2018-11-23 05:03:37,033 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:03:37,033 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:03:37,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:03:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:03:37,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:03:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:03:37,151 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:03:37,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:03:37,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:03:37,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:03:37,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:03:37,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:03:37,171 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2018-11-23 05:03:37,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:03:37,272 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2018-11-23 05:03:37,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:03:37,274 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 05:03:37,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:03:37,282 INFO L225 Difference]: With dead ends: 95 [2018-11-23 05:03:37,283 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 05:03:37,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:03:37,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 05:03:37,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-23 05:03:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 05:03:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-23 05:03:37,316 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 24 [2018-11-23 05:03:37,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:03:37,317 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-23 05:03:37,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:03:37,317 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 05:03:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 05:03:37,319 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:03:37,319 INFO L402 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] [2018-11-23 05:03:37,319 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:03:37,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:03:37,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2132511215, now seen corresponding path program 1 times [2018-11-23 05:03:37,320 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:03:37,320 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:03:37,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:03:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:03:37,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:03:37,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:03:37,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:03:37,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:03:37,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:03:37,610 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:03:37,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:03:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:03:37,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:03:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:03:37,717 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:03:37,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:03:37,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 12 [2018-11-23 05:03:37,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 05:03:37,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 05:03:37,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-11-23 05:03:37,747 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 12 states. [2018-11-23 05:03:38,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:03:38,059 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2018-11-23 05:03:38,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 05:03:38,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-11-23 05:03:38,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:03:38,061 INFO L225 Difference]: With dead ends: 82 [2018-11-23 05:03:38,061 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 05:03:38,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-11-23 05:03:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 05:03:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2018-11-23 05:03:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 05:03:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-11-23 05:03:38,071 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 33 [2018-11-23 05:03:38,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:03:38,071 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-11-23 05:03:38,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 05:03:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-23 05:03:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 05:03:38,074 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:03:38,074 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:03:38,075 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:03:38,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:03:38,075 INFO L82 PathProgramCache]: Analyzing trace with hash -743230615, now seen corresponding path program 1 times [2018-11-23 05:03:38,076 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:03:38,076 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:03:38,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:03:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:03:38,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:03:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 05:03:38,207 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:03:38,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:03:38,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 05:03:38,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:03:38,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:03:38,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:03:38,209 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 6 states. [2018-11-23 05:03:38,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:03:38,291 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-11-23 05:03:38,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:03:38,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-23 05:03:38,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:03:38,294 INFO L225 Difference]: With dead ends: 79 [2018-11-23 05:03:38,294 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 05:03:38,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:03:38,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 05:03:38,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2018-11-23 05:03:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 05:03:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-11-23 05:03:38,305 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 50 [2018-11-23 05:03:38,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:03:38,305 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-11-23 05:03:38,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:03:38,305 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 05:03:38,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 05:03:38,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:03:38,306 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:03:38,307 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:03:38,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:03:38,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1022926566, now seen corresponding path program 1 times [2018-11-23 05:03:38,307 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:03:38,307 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:03:38,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:03:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:03:38,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:03:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:03:38,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:03:38,509 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:03:38,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:03:38,511 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:03:38,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:03:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:03:38,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:03:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:03:38,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:03:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:03:38,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 05:03:38,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 6] total 10 [2018-11-23 05:03:38,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 05:03:38,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 05:03:38,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:03:38,663 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 10 states. [2018-11-23 05:03:38,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:03:38,829 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2018-11-23 05:03:38,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:03:38,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2018-11-23 05:03:38,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:03:38,831 INFO L225 Difference]: With dead ends: 91 [2018-11-23 05:03:38,831 INFO L226 Difference]: Without dead ends: 79 [2018-11-23 05:03:38,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-11-23 05:03:38,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-23 05:03:38,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2018-11-23 05:03:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 05:03:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-11-23 05:03:38,843 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 51 [2018-11-23 05:03:38,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:03:38,843 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-11-23 05:03:38,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 05:03:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-23 05:03:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 05:03:38,845 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:03:38,845 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:03:38,845 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:03:38,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:03:38,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1421438384, now seen corresponding path program 2 times [2018-11-23 05:03:38,846 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:03:38,846 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:03:38,869 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 05:03:38,900 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 05:03:38,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:03:38,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:03:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 05:03:38,929 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:03:38,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:03:38,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 05:03:38,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:03:38,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:03:38,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:03:38,931 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 6 states. [2018-11-23 05:03:39,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:03:39,000 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2018-11-23 05:03:39,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:03:39,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-11-23 05:03:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:03:39,002 INFO L225 Difference]: With dead ends: 81 [2018-11-23 05:03:39,002 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 05:03:39,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:03:39,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 05:03:39,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-11-23 05:03:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 05:03:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2018-11-23 05:03:39,012 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 59 [2018-11-23 05:03:39,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:03:39,012 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2018-11-23 05:03:39,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:03:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-11-23 05:03:39,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 05:03:39,014 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:03:39,014 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:03:39,014 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:03:39,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:03:39,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1578136644, now seen corresponding path program 1 times [2018-11-23 05:03:39,014 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:03:39,014 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:03:39,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:03:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:03:39,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:03:39,183 INFO L478 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 [2018-11-23 05:03:39,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:39,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:39,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 05:03:39,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:03:39,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:03:39,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 05:03:39,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:39,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:39,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-23 05:03:39,307 INFO L478 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 11 treesize of output 8 [2018-11-23 05:03:39,310 INFO L478 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 8 treesize of output 7 [2018-11-23 05:03:39,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:39,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:39,329 INFO L478 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 11 treesize of output 8 [2018-11-23 05:03:39,332 INFO L478 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 8 treesize of output 7 [2018-11-23 05:03:39,332 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:39,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:39,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:39,344 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-11-23 05:03:39,622 INFO L478 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 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-23 05:03:39,627 INFO L478 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 20 treesize of output 19 [2018-11-23 05:03:39,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:39,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:39,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:39,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-11-23 05:03:39,791 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:03:39,807 INFO L478 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 115 treesize of output 116 [2018-11-23 05:03:39,812 INFO L478 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 36 treesize of output 1 [2018-11-23 05:03:39,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:39,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:39,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:03:39,868 INFO L478 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 0 case distinctions, treesize of input 78 treesize of output 82 [2018-11-23 05:03:39,871 INFO L478 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 36 treesize of output 1 [2018-11-23 05:03:39,871 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:39,878 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:39,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:39,890 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:131, output treesize:43 [2018-11-23 05:03:50,189 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 05:03:50,213 INFO L478 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 0 case distinctions, treesize of input 51 treesize of output 44 [2018-11-23 05:03:50,223 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:03:50,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2018-11-23 05:03:50,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:50,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:50,305 INFO L478 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 0 case distinctions, treesize of input 41 treesize of output 36 [2018-11-23 05:03:50,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:03:50,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-11-23 05:03:50,315 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:50,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:50,353 INFO L478 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 37 treesize of output 44 [2018-11-23 05:03:50,356 INFO L478 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 8 treesize of output 7 [2018-11-23 05:03:50,356 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:50,365 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:50,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:50,381 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:85, output treesize:44 [2018-11-23 05:03:51,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 48 [2018-11-23 05:03:51,014 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2018-11-23 05:03:51,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:51,036 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 18 [2018-11-23 05:03:51,036 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:51,054 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 5 [2018-11-23 05:03:51,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:51,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:51,088 INFO L478 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 21 [2018-11-23 05:03:51,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 15 [2018-11-23 05:03:51,091 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:51,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2018-11-23 05:03:51,103 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:51,105 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:51,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:51,108 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:69, output treesize:9 [2018-11-23 05:03:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 05:03:51,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:03:52,308 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 05:03:52,412 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 05:03:52,416 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:52,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:52,443 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:52,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:52,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:52,453 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:37 [2018-11-23 05:03:52,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:03:52,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:03:52,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:03:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:03:52,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:03:52,717 INFO L478 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 [2018-11-23 05:03:52,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:52,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:52,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 05:03:52,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:03:52,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:03:52,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 05:03:52,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:52,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:52,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-23 05:03:52,768 INFO L478 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 11 treesize of output 8 [2018-11-23 05:03:52,772 INFO L478 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 8 treesize of output 7 [2018-11-23 05:03:52,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:52,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:52,795 INFO L478 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 11 treesize of output 8 [2018-11-23 05:03:52,798 INFO L478 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 8 treesize of output 7 [2018-11-23 05:03:52,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:52,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:52,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:52,818 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-11-23 05:03:52,891 INFO L478 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 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-23 05:03:52,896 INFO L478 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 20 treesize of output 19 [2018-11-23 05:03:52,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:52,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:52,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:52,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-11-23 05:03:52,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:03:52,955 INFO L478 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 0 case distinctions, treesize of input 123 treesize of output 127 [2018-11-23 05:03:52,959 INFO L478 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 36 treesize of output 1 [2018-11-23 05:03:52,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:52,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:53,018 INFO L478 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 70 treesize of output 71 [2018-11-23 05:03:53,021 INFO L478 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 36 treesize of output 1 [2018-11-23 05:03:53,021 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:53,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:53,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:53,039 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:131, output treesize:43 [2018-11-23 05:03:53,062 INFO L478 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 0 case distinctions, treesize of input 41 treesize of output 36 [2018-11-23 05:03:53,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:03:53,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-11-23 05:03:53,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:53,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:53,151 INFO L478 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 37 treesize of output 44 [2018-11-23 05:03:53,155 INFO L478 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 8 treesize of output 7 [2018-11-23 05:03:53,155 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:53,167 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:53,197 INFO L478 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 0 case distinctions, treesize of input 51 treesize of output 44 [2018-11-23 05:03:53,203 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:03:53,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2018-11-23 05:03:53,208 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:53,224 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:53,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:53,252 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:85, output treesize:44 [2018-11-23 05:03:53,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 48 [2018-11-23 05:03:53,373 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 33 [2018-11-23 05:03:53,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:53,417 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 5 [2018-11-23 05:03:53,418 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:53,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:53,461 INFO L478 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 21 [2018-11-23 05:03:53,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 15 [2018-11-23 05:03:53,465 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:53,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2018-11-23 05:03:53,478 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:03:53,480 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:53,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:03:53,483 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:69, output treesize:9 [2018-11-23 05:03:53,496 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 05:03:53,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:03:54,072 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 05:03:54,175 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:54,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:54,207 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:54,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:54,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 05:03:54,228 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:44 [2018-11-23 05:03:54,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:03:54,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-11-23 05:03:54,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 05:03:54,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 05:03:54,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1585, Unknown=17, NotChecked=0, Total=1722 [2018-11-23 05:03:54,438 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 31 states. [2018-11-23 05:04:34,662 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-23 05:05:42,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:05:42,574 INFO L93 Difference]: Finished difference Result 119 states and 157 transitions. [2018-11-23 05:05:42,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 05:05:42,575 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-11-23 05:05:42,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:05:42,576 INFO L225 Difference]: With dead ends: 119 [2018-11-23 05:05:42,576 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 05:05:42,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 52.4s TimeCoverageRelationStatistics Valid=319, Invalid=3801, Unknown=40, NotChecked=0, Total=4160 [2018-11-23 05:05:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 05:05:42,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2018-11-23 05:05:42,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 05:05:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 137 transitions. [2018-11-23 05:05:42,593 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 137 transitions. Word has length 60 [2018-11-23 05:05:42,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:05:42,593 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 137 transitions. [2018-11-23 05:05:42,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 05:05:42,593 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 137 transitions. [2018-11-23 05:05:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 05:05:42,595 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:05:42,595 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:05:42,595 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:05:42,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:05:42,596 INFO L82 PathProgramCache]: Analyzing trace with hash -75682000, now seen corresponding path program 2 times [2018-11-23 05:05:42,596 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:05:42,596 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:05:42,613 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 05:05:42,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:05:42,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:05:42,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:05:42,757 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 05:05:42,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:05:42,876 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 05:05:42,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:05:42,878 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:05:42,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:05:42,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:05:42,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:05:42,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:05:43,000 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 05:05:43,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:05:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 05:05:43,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 05:05:43,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-11-23 05:05:43,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 05:05:43,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 05:05:43,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-11-23 05:05:43,383 INFO L87 Difference]: Start difference. First operand 102 states and 137 transitions. Second operand 18 states. [2018-11-23 05:05:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:05:44,286 INFO L93 Difference]: Finished difference Result 171 states and 236 transitions. [2018-11-23 05:05:44,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 05:05:44,287 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2018-11-23 05:05:44,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:05:44,289 INFO L225 Difference]: With dead ends: 171 [2018-11-23 05:05:44,289 INFO L226 Difference]: Without dead ends: 139 [2018-11-23 05:05:44,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-11-23 05:05:44,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-11-23 05:05:44,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 129. [2018-11-23 05:05:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-23 05:05:44,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 179 transitions. [2018-11-23 05:05:44,315 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 179 transitions. Word has length 61 [2018-11-23 05:05:44,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:05:44,315 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 179 transitions. [2018-11-23 05:05:44,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 05:05:44,315 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 179 transitions. [2018-11-23 05:05:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 05:05:44,317 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:05:44,317 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:05:44,317 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:05:44,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:05:44,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1438698009, now seen corresponding path program 3 times [2018-11-23 05:05:44,318 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:05:44,318 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:05:44,339 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 05:05:44,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 05:05:44,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:05:44,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:05:44,532 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 05:05:44,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:05:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 05:05:44,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:05:44,618 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:05:44,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:05:44,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 05:05:44,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:05:44,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:05:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 05:05:44,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:05:44,944 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 05:05:44,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2018-11-23 05:05:44,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7, 7] total 15 [2018-11-23 05:05:44,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 05:05:44,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 05:05:44,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-11-23 05:05:44,962 INFO L87 Difference]: Start difference. First operand 129 states and 179 transitions. Second operand 15 states. [2018-11-23 05:05:45,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:05:45,207 INFO L93 Difference]: Finished difference Result 188 states and 258 transitions. [2018-11-23 05:05:45,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:05:45,209 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2018-11-23 05:05:45,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:05:45,211 INFO L225 Difference]: With dead ends: 188 [2018-11-23 05:05:45,211 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 05:05:45,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 228 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-11-23 05:05:45,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 05:05:45,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-11-23 05:05:45,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-11-23 05:05:45,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 169 transitions. [2018-11-23 05:05:45,239 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 169 transitions. Word has length 61 [2018-11-23 05:05:45,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:05:45,239 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 169 transitions. [2018-11-23 05:05:45,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 05:05:45,239 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 169 transitions. [2018-11-23 05:05:45,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 05:05:45,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:05:45,241 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:05:45,241 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:05:45,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:05:45,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1647374291, now seen corresponding path program 4 times [2018-11-23 05:05:45,242 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:05:45,242 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:05:45,259 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:05:45,340 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:05:45,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:05:45,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:05:45,428 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 05:05:45,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:05:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 05:05:45,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:05:45,618 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:05:45,625 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:05:45,654 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:05:45,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:05:45,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:05:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 05:05:45,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:05:46,080 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 05:05:46,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 05:05:46,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-11-23 05:05:46,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 05:05:46,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 05:05:46,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-11-23 05:05:46,097 INFO L87 Difference]: Start difference. First operand 131 states and 169 transitions. Second operand 18 states. [2018-11-23 05:05:46,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:05:46,920 INFO L93 Difference]: Finished difference Result 156 states and 193 transitions. [2018-11-23 05:05:46,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 05:05:46,921 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 61 [2018-11-23 05:05:46,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:05:46,922 INFO L225 Difference]: With dead ends: 156 [2018-11-23 05:05:46,922 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 05:05:46,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 225 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2018-11-23 05:05:46,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 05:05:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2018-11-23 05:05:46,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 05:05:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2018-11-23 05:05:46,936 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 61 [2018-11-23 05:05:46,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:05:46,937 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2018-11-23 05:05:46,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 05:05:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2018-11-23 05:05:46,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 05:05:46,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:05:46,938 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:05:46,938 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:05:46,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:05:46,938 INFO L82 PathProgramCache]: Analyzing trace with hash 485399127, now seen corresponding path program 1 times [2018-11-23 05:05:46,938 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:05:46,938 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:05:46,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:05:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:05:47,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:05:47,206 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 05:05:47,207 INFO L478 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 8 treesize of output 7 [2018-11-23 05:05:47,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:05:47,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:05:47,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:05:47,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-23 05:05:47,513 INFO L478 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 22 treesize of output 24 [2018-11-23 05:05:47,516 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-23 05:05:47,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:05:47,526 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 05:05:47,527 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:05:47,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:05:47,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:05:47,533 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:27, output treesize:9 [2018-11-23 05:05:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 05:05:47,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:05:48,177 INFO L478 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 11 treesize of output 9 [2018-11-23 05:05:48,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2018-11-23 05:05:48,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:05:48,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:05:48,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-23 05:05:48,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:41 [2018-11-23 05:05:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 05:05:48,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:05:48,699 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:05:48,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:05:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:05:48,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:05:48,926 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 05:05:48,928 INFO L478 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 8 treesize of output 7 [2018-11-23 05:05:48,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:05:48,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:05:48,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:05:48,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-23 05:05:49,775 INFO L478 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 26 [2018-11-23 05:05:49,778 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-23 05:05:49,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:05:49,798 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:05:49,799 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-23 05:05:49,799 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:05:49,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:05:49,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:05:49,810 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:9 [2018-11-23 05:05:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 05:05:49,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:05:51,300 INFO L478 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 11 treesize of output 9 [2018-11-23 05:05:51,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2018-11-23 05:05:51,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:05:51,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:05:51,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-23 05:05:51,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:74 [2018-11-23 05:05:51,631 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 05:05:51,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 05:05:51,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 18, 15] total 58 [2018-11-23 05:05:51,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-23 05:05:51,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-23 05:05:51,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=3017, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 05:05:51,649 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand 58 states. [2018-11-23 05:06:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:06:02,721 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2018-11-23 05:06:02,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 05:06:02,721 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 69 [2018-11-23 05:06:02,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:06:02,722 INFO L225 Difference]: With dead ends: 123 [2018-11-23 05:06:02,722 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 05:06:02,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 213 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1515 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=502, Invalid=4610, Unknown=0, NotChecked=0, Total=5112 [2018-11-23 05:06:02,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 05:06:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 05:06:02,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 05:06:02,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-11-23 05:06:02,730 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 69 [2018-11-23 05:06:02,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:06:02,731 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-11-23 05:06:02,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-23 05:06:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-23 05:06:02,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 05:06:02,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:06:02,731 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:06:02,732 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:06:02,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:06:02,732 INFO L82 PathProgramCache]: Analyzing trace with hash -530582539, now seen corresponding path program 2 times [2018-11-23 05:06:02,733 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:06:02,733 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:06:02,755 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 05:06:02,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:06:02,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:06:02,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:06:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 05:06:02,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:06:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 05:06:02,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:06:02,962 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0670c15-1ce6-48c8-9d84-363248d2e744/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:06:02,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:06:03,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:06:03,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:06:03,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:06:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 05:06:03,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:06:03,278 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 05:06:03,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 05:06:03,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-11-23 05:06:03,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 05:06:03,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 05:06:03,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2018-11-23 05:06:03,294 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 18 states. [2018-11-23 05:06:03,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:06:03,516 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-11-23 05:06:03,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 05:06:03,517 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-11-23 05:06:03,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:06:03,517 INFO L225 Difference]: With dead ends: 63 [2018-11-23 05:06:03,517 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 05:06:03,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2018-11-23 05:06:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 05:06:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 05:06:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 05:06:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 05:06:03,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-11-23 05:06:03,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:06:03,518 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:06:03,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 05:06:03,518 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:06:03,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 05:06:03,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 05:06:03,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:06:03,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:06:03,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:06:03,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:06:03,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:06:03,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:06:03,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:06:03,669 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:06:03,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:06:03,961 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-11-23 05:06:04,144 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2018-11-23 05:06:04,540 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2018-11-23 05:06:04,739 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2018-11-23 05:06:05,064 WARN L180 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2018-11-23 05:06:05,283 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-11-23 05:06:05,286 INFO L451 ceAbstractionStarter]: At program point L561(line 561) the Hoare annotation is: true [2018-11-23 05:06:05,286 INFO L448 ceAbstractionStarter]: For program point exitEXIT(lines 560 562) no Hoare annotation was computed. [2018-11-23 05:06:05,286 INFO L451 ceAbstractionStarter]: At program point exitENTRY(lines 560 562) the Hoare annotation is: true [2018-11-23 05:06:05,286 INFO L448 ceAbstractionStarter]: For program point exitFINAL(lines 560 562) no Hoare annotation was computed. [2018-11-23 05:06:05,286 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 05:06:05,286 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-23 05:06:05,286 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 05:06:05,286 INFO L448 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 581 587) no Hoare annotation was computed. [2018-11-23 05:06:05,286 INFO L451 ceAbstractionStarter]: At program point L582-2(lines 582 586) the Hoare annotation is: true [2018-11-23 05:06:05,286 INFO L451 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 581 587) the Hoare annotation is: true [2018-11-23 05:06:05,286 INFO L448 ceAbstractionStarter]: For program point L582-3(lines 581 587) no Hoare annotation was computed. [2018-11-23 05:06:05,286 INFO L448 ceAbstractionStarter]: For program point sll_update_atFINAL(lines 595 601) no Hoare annotation was computed. [2018-11-23 05:06:05,286 INFO L444 ceAbstractionStarter]: At program point L596-2(lines 596 599) the Hoare annotation is: (let ((.cse0 (= |sll_update_at_#in~index| sll_update_at_~index)) (.cse1 (= sll_update_at_~head.base |sll_update_at_#in~head.base|)) (.cse2 (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset)) (.cse3 (= sll_update_at_~data |sll_update_at_#in~data|))) (and (or (bvsgt (bvadd |sll_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32)) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (and (= (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) .cse4) sll_update_at_~head.base) (= (bvadd sll_update_at_~index (_ bv1 32)) |sll_update_at_#in~index|) .cse3 (= (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) .cse4) sll_update_at_~head.offset)))) (let ((.cse5 (= |old(#memory_int)| |#memory_int|)) (.cse6 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse7 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (or (and .cse0 .cse1 .cse5 .cse2 .cse6 .cse3 .cse7) (and .cse5 .cse6 .cse7 (bvsgt |sll_update_at_#in~index| (_ bv0 32))))))) [2018-11-23 05:06:05,287 INFO L448 ceAbstractionStarter]: For program point L596-3(lines 596 599) no Hoare annotation was computed. [2018-11-23 05:06:05,287 INFO L448 ceAbstractionStarter]: For program point sll_update_atEXIT(lines 595 601) no Hoare annotation was computed. [2018-11-23 05:06:05,287 INFO L444 ceAbstractionStarter]: At program point sll_update_atENTRY(lines 595 601) the Hoare annotation is: (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-23 05:06:05,287 INFO L444 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (let ((.cse1 (= (_ bv0 32) sll_create_~head~0.offset)) (.cse0 (or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32))))) (or (and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) .cse0 .cse1) (and (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse1 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) .cse0))) [2018-11-23 05:06:05,287 INFO L448 ceAbstractionStarter]: For program point sll_createEXIT(lines 572 580) no Hoare annotation was computed. [2018-11-23 05:06:05,287 INFO L448 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-11-23 05:06:05,287 INFO L448 ceAbstractionStarter]: For program point L574-2(lines 574 578) no Hoare annotation was computed. [2018-11-23 05:06:05,287 INFO L444 ceAbstractionStarter]: At program point L574-3(lines 574 578) the Hoare annotation is: (let ((.cse1 (= (_ bv1 1) (select |#valid| sll_create_~head~0.base))) (.cse0 (= (_ bv0 32) sll_create_~head~0.offset))) (or (and (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) .cse0 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (and .cse1 (= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len) .cse0) (and .cse1 (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) .cse0))) [2018-11-23 05:06:05,287 INFO L448 ceAbstractionStarter]: For program point L574-4(lines 574 578) no Hoare annotation was computed. [2018-11-23 05:06:05,287 INFO L444 ceAbstractionStarter]: At program point sll_createENTRY(lines 572 580) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-23 05:06:05,287 INFO L448 ceAbstractionStarter]: For program point sll_createFINAL(lines 572 580) no Hoare annotation was computed. [2018-11-23 05:06:05,287 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 05:06:05,287 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 05:06:05,287 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 05:06:05,287 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 05:06:05,287 INFO L444 ceAbstractionStarter]: At program point L609(line 609) the Hoare annotation is: (let ((.cse5 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse4 (bvneg main_~len~0)) (.cse1 (= main_~s~0.offset (_ bv0 32)))) (or (let ((.cse3 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse0 (select .cse5 .cse3)) (.cse2 (bvadd main_~len~0 (_ bv4294967294 32)))) (and (not (= .cse0 main_~s~0.base)) .cse1 (= .cse2 (_ bv0 32)) (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) (= (bvadd (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse3)) (_ bv1 32)) (bvadd (bvneg .cse4) main_~len~0)) (= .cse2 main_~i~0)))) (and (not (= (select .cse5 (_ bv4 32)) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd .cse4 main_~new_data~0)) .cse1 (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))) [2018-11-23 05:06:05,288 INFO L448 ceAbstractionStarter]: For program point L611-2(lines 611 616) no Hoare annotation was computed. [2018-11-23 05:06:05,288 INFO L448 ceAbstractionStarter]: For program point L609-1(lines 607 610) no Hoare annotation was computed. [2018-11-23 05:06:05,288 INFO L444 ceAbstractionStarter]: At program point L611-3(lines 611 616) the Hoare annotation is: (let ((.cse9 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse5 (bvadd main_~len~0 (_ bv4294967294 32))) (.cse8 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse9)) (.cse10 (bvadd (bvmul (_ bv2 32) main_~len~0) (_ bv4294967294 32))) (.cse7 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (let ((.cse1 (= .cse10 .cse7)) (.cse0 (not (= .cse8 main_~s~0.base))) (.cse6 (= .cse10 main_~new_data~0)) (.cse2 (= main_~s~0.offset (_ bv0 32))) (.cse3 (= .cse5 (_ bv0 32))) (.cse4 (= (bvadd (select (select |#memory_int| .cse8) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse9)) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) .cse4 (= .cse5 main_~i~0)) (and .cse1 .cse0 .cse6 .cse2 .cse4 (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 .cse6 .cse2 (= (_ bv2 32) .cse7) .cse3 .cse4 (= (bvadd main_~expected~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967293 32)) main_~i~0)))))) [2018-11-23 05:06:05,288 INFO L444 ceAbstractionStarter]: At program point L611-4(lines 611 616) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-11-23 05:06:05,289 INFO L444 ceAbstractionStarter]: At program point L605(line 605) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-23 05:06:05,289 INFO L444 ceAbstractionStarter]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.base| main_~s~0.base)) (.cse9 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse2 (bvneg main_~len~0)) (.cse6 (bvadd main_~len~0 (_ bv4294967294 32))) (.cse8 (select .cse0 .cse9))) (let ((.cse3 (not (= .cse8 main_~s~0.base))) (.cse1 (= main_~s~0.offset (_ bv0 32))) (.cse4 (= .cse6 (_ bv0 32))) (.cse5 (= (bvadd (select (select |#memory_int| .cse8) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse9)) (_ bv1 32)) (bvadd (bvneg .cse2) main_~len~0)))) (or (and (not (= (select .cse0 (_ bv4 32)) main_~s~0.base)) .cse1 (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and (= (bvadd main_~len~0 (_ bv4294967295 32)) (bvadd .cse2 main_~new_data~0)) .cse3 .cse1 .cse4 .cse5 (= .cse6 main_~i~0)) (let ((.cse7 (bvadd (bvmul (_ bv2 32) main_~len~0) (_ bv4294967294 32)))) (and (= .cse7 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) .cse3 (= .cse7 main_~new_data~0) .cse1 .cse4 .cse5 (= (bvadd main_~len~0 (_ bv4294967293 32)) main_~i~0))))))) [2018-11-23 05:06:05,289 INFO L448 ceAbstractionStarter]: For program point L605-1(line 605) no Hoare annotation was computed. [2018-11-23 05:06:05,289 INFO L448 ceAbstractionStarter]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2018-11-23 05:06:05,289 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 602 621) no Hoare annotation was computed. [2018-11-23 05:06:05,289 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2018-11-23 05:06:05,289 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 602 621) no Hoare annotation was computed. [2018-11-23 05:06:05,289 INFO L444 ceAbstractionStarter]: At program point L614(lines 602 621) the Hoare annotation is: false [2018-11-23 05:06:05,290 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 602 621) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-23 05:06:05,290 INFO L448 ceAbstractionStarter]: For program point L617(line 617) no Hoare annotation was computed. [2018-11-23 05:06:05,290 INFO L444 ceAbstractionStarter]: At program point L613(line 613) the Hoare annotation is: (let ((.cse7 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse6 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse7))) (let ((.cse2 (not (= .cse6 main_~s~0.base))) (.cse3 (= main_~s~0.offset (_ bv0 32))) (.cse1 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse4 (= (bvadd (select (select |#memory_int| .cse6) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse7)) (_ bv1 32)) (bvadd (bvneg (bvneg main_~len~0)) main_~len~0)))) (or (let ((.cse0 (bvadd (bvmul (_ bv2 32) main_~len~0) (_ bv4294967294 32)))) (and (= .cse0 .cse1) .cse2 (= .cse0 main_~new_data~0) .cse3 (= (_ bv3 32) main_~expected~0) .cse4 (= (bvadd main_~i~0 (_ bv1 32)) main_~len~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))) (let ((.cse5 (bvadd main_~len~0 (_ bv4294967294 32)))) (and .cse2 .cse3 (= (bvadd main_~i~0 (_ bv2 32)) .cse1) (= .cse5 (_ bv0 32)) (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) .cse4 (= (bvadd main_~expected~0 (_ bv4294967294 32)) (_ bv0 32)) (= .cse5 main_~i~0))))))) [2018-11-23 05:06:05,290 INFO L448 ceAbstractionStarter]: For program point L613-1(lines 613 615) no Hoare annotation was computed. [2018-11-23 05:06:05,290 INFO L451 ceAbstractionStarter]: At program point sll_get_data_atENTRY(lines 588 594) the Hoare annotation is: true [2018-11-23 05:06:05,290 INFO L448 ceAbstractionStarter]: For program point sll_get_data_atFINAL(lines 588 594) no Hoare annotation was computed. [2018-11-23 05:06:05,290 INFO L444 ceAbstractionStarter]: At program point L589-2(lines 589 592) the Hoare annotation is: (let ((.cse2 (bvadd |sll_get_data_at_#in~index| (_ bv4294967295 32)))) (or (and (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|)) (forall ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))) (or (= v_main_~s~0.base_BEFORE_CALL_3 .cse0) (not (= (_ bv3 32) (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))))))) (let ((.cse1 (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (and (bvsgt |sll_get_data_at_#in~index| (_ bv0 32)) (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) .cse1)) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) .cse1)) (= .cse2 sll_get_data_at_~index))) (forall ((v_main_~s~0.base_BEFORE_CALL_9 (_ BitVec 32))) (not (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_9) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))) (bvsgt .cse2 (_ bv0 32)))) [2018-11-23 05:06:05,290 INFO L448 ceAbstractionStarter]: For program point L589-3(lines 589 592) no Hoare annotation was computed. [2018-11-23 05:06:05,291 INFO L448 ceAbstractionStarter]: For program point sll_get_data_atEXIT(lines 588 594) no Hoare annotation was computed. [2018-11-23 05:06:05,291 INFO L444 ceAbstractionStarter]: At program point node_createENTRY(lines 563 571) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-23 05:06:05,291 INFO L448 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-11-23 05:06:05,291 INFO L451 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-11-23 05:06:05,291 INFO L448 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-11-23 05:06:05,291 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-11-23 05:06:05,291 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-11-23 05:06:05,295 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 05:06:05,297 INFO L168 Benchmark]: Toolchain (without parser) took 149128.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 228.1 MB). Free memory was 943.8 MB in the beginning and 914.1 MB in the end (delta: 29.7 MB). Peak memory consumption was 257.8 MB. Max. memory is 11.5 GB. [2018-11-23 05:06:05,297 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:06:05,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 429.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:06:05,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-23 05:06:05,298 INFO L168 Benchmark]: Boogie Preprocessor took 24.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:06:05,298 INFO L168 Benchmark]: RCFGBuilder took 309.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-11-23 05:06:05,299 INFO L168 Benchmark]: TraceAbstraction took 148338.55 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.1 GB in the beginning and 914.1 MB in the end (delta: 151.3 MB). Peak memory consumption was 268.2 MB. Max. memory is 11.5 GB. [2018-11-23 05:06:05,301 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 429.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 943.8 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 45.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.93 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.90 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 309.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 148338.55 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 116.9 MB). Free memory was 1.1 GB in the beginning and 914.1 MB in the end (delta: 151.3 MB). Peak memory consumption was 268.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 619]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...