./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/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 8b88a605df784da4b84aa984e355b57373efff76 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/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 8b88a605df784da4b84aa984e355b57373efff76 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_44 term size 60 --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 23:03:29,849 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:03:29,852 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:03:29,862 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:03:29,863 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:03:29,864 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:03:29,866 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:03:29,868 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:03:29,870 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:03:29,870 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:03:29,871 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:03:29,871 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:03:29,872 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:03:29,873 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:03:29,873 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:03:29,874 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:03:29,875 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:03:29,876 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:03:29,877 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:03:29,878 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:03:29,879 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:03:29,880 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:03:29,881 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:03:29,882 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:03:29,882 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:03:29,890 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:03:29,891 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:03:29,892 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:03:29,892 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:03:29,893 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:03:29,893 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:03:29,894 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:03:29,894 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:03:29,894 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:03:29,895 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:03:29,895 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:03:29,895 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 23:03:29,909 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:03:29,909 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:03:29,910 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:03:29,910 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 23:03:29,910 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 23:03:29,910 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 23:03:29,910 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 23:03:29,910 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 23:03:29,911 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 23:03:29,911 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 23:03:29,911 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 23:03:29,911 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:03:29,911 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:03:29,912 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 23:03:29,912 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:03:29,912 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:03:29,912 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:03:29,912 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:03:29,912 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:03:29,912 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:03:29,912 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:03:29,913 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:03:29,913 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:03:29,913 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 23:03:29,913 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:03:29,913 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 23:03:29,913 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 23:03:29,913 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:03:29,914 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:03:29,914 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:03:29,914 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 23:03:29,914 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:03:29,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 23:03:29,915 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 23:03:29,915 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_ab6be8bb-acaa-4810-860f-907accfcd4a4/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 -> 8b88a605df784da4b84aa984e355b57373efff76 [2018-10-26 23:03:29,958 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:03:29,972 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:03:29,976 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:03:29,977 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:03:29,977 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:03:29,978 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i [2018-10-26 23:03:30,018 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/data/bf78d6870/a19c2575f2e14b80ba2d5ffbfd1a6142/FLAG99bd44c41 [2018-10-26 23:03:30,435 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:03:30,436 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/sv-benchmarks/c/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i [2018-10-26 23:03:30,446 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/data/bf78d6870/a19c2575f2e14b80ba2d5ffbfd1a6142/FLAG99bd44c41 [2018-10-26 23:03:30,457 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/data/bf78d6870/a19c2575f2e14b80ba2d5ffbfd1a6142 [2018-10-26 23:03:30,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:03:30,460 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 23:03:30,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:03:30,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:03:30,464 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:03:30,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:03:30" (1/1) ... [2018-10-26 23:03:30,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15e4eb0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:03:30, skipping insertion in model container [2018-10-26 23:03:30,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:03:30" (1/1) ... [2018-10-26 23:03:30,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:03:30,510 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:03:30,730 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:03:30,737 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:03:30,785 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:03:30,831 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:03:30,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:03:30 WrapperNode [2018-10-26 23:03:30,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:03:30,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 23:03:30,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 23:03:30,833 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 23:03:30,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:03:30" (1/1) ... [2018-10-26 23:03:30,853 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:03:30" (1/1) ... [2018-10-26 23:03:30,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 23:03:30,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:03:30,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:03:30,937 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:03:30,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:03:30" (1/1) ... [2018-10-26 23:03:30,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:03:30" (1/1) ... [2018-10-26 23:03:30,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:03:30" (1/1) ... [2018-10-26 23:03:30,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:03:30" (1/1) ... [2018-10-26 23:03:30,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:03:30" (1/1) ... [2018-10-26 23:03:30,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:03:30" (1/1) ... [2018-10-26 23:03:30,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:03:30" (1/1) ... [2018-10-26 23:03:30,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:03:30,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:03:30,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:03:30,975 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:03:30,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:03:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/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-10-26 23:03:31,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 23:03:31,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 23:03:31,023 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 23:03:31,023 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 23:03:31,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:03:31,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:03:31,637 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:03:31,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:03:31 BoogieIcfgContainer [2018-10-26 23:03:31,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:03:31,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 23:03:31,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 23:03:31,640 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 23:03:31,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 11:03:30" (1/3) ... [2018-10-26 23:03:31,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54155d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:03:31, skipping insertion in model container [2018-10-26 23:03:31,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:03:30" (2/3) ... [2018-10-26 23:03:31,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54155d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:03:31, skipping insertion in model container [2018-10-26 23:03:31,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:03:31" (3/3) ... [2018-10-26 23:03:31,642 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token_true-unreach-call_true-valid-memsafety.i [2018-10-26 23:03:31,650 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 23:03:31,657 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-10-26 23:03:31,671 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-10-26 23:03:31,697 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 23:03:31,697 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 23:03:31,697 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 23:03:31,697 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 23:03:31,697 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 23:03:31,698 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 23:03:31,698 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 23:03:31,698 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 23:03:31,713 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-10-26 23:03:31,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-26 23:03:31,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:03:31,718 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:03:31,720 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:03:31,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:03:31,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1504952782, now seen corresponding path program 1 times [2018-10-26 23:03:31,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:03:31,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:03:31,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:03:31,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:03:31,778 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:03:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:03:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:03:31,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:03:31,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 23:03:31,865 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:03:31,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 23:03:31,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 23:03:31,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 23:03:31,883 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-10-26 23:03:31,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:03:31,907 INFO L93 Difference]: Finished difference Result 102 states and 148 transitions. [2018-10-26 23:03:31,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 23:03:31,909 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-10-26 23:03:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:03:31,917 INFO L225 Difference]: With dead ends: 102 [2018-10-26 23:03:31,917 INFO L226 Difference]: Without dead ends: 48 [2018-10-26 23:03:31,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 23:03:31,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-26 23:03:31,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-26 23:03:31,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-26 23:03:31,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-10-26 23:03:31,953 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2018-10-26 23:03:31,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:03:31,953 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-10-26 23:03:31,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 23:03:31,953 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-10-26 23:03:31,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-26 23:03:31,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:03:31,954 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:03:31,956 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:03:31,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:03:31,956 INFO L82 PathProgramCache]: Analyzing trace with hash -266784320, now seen corresponding path program 1 times [2018-10-26 23:03:31,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:03:31,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:03:31,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:03:31,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:03:31,958 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:03:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:03:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:03:32,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:03:32,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:03:32,132 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:03:32,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:03:32,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:03:32,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:03:32,134 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 4 states. [2018-10-26 23:03:32,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:03:32,287 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-10-26 23:03:32,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:03:32,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-10-26 23:03:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:03:32,288 INFO L225 Difference]: With dead ends: 48 [2018-10-26 23:03:32,288 INFO L226 Difference]: Without dead ends: 46 [2018-10-26 23:03:32,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:03:32,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-26 23:03:32,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-26 23:03:32,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-26 23:03:32,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-10-26 23:03:32,293 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 12 [2018-10-26 23:03:32,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:03:32,293 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-10-26 23:03:32,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:03:32,293 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-10-26 23:03:32,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 23:03:32,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:03:32,294 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:03:32,294 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:03:32,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:03:32,296 INFO L82 PathProgramCache]: Analyzing trace with hash 318390392, now seen corresponding path program 1 times [2018-10-26 23:03:32,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:03:32,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:03:32,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:03:32,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:03:32,298 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:03:32,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:03:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:03:32,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:03:32,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:03:32,414 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:03:32,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:03:32,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:03:32,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:03:32,415 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 4 states. [2018-10-26 23:03:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:03:32,640 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-10-26 23:03:32,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:03:32,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-10-26 23:03:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:03:32,642 INFO L225 Difference]: With dead ends: 75 [2018-10-26 23:03:32,642 INFO L226 Difference]: Without dead ends: 73 [2018-10-26 23:03:32,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:03:32,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-26 23:03:32,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2018-10-26 23:03:32,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-26 23:03:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-10-26 23:03:32,648 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 13 [2018-10-26 23:03:32,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:03:32,648 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-10-26 23:03:32,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:03:32,648 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-10-26 23:03:32,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-26 23:03:32,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:03:32,649 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:03:32,649 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:03:32,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:03:32,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1262223739, now seen corresponding path program 1 times [2018-10-26 23:03:32,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:03:32,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:03:32,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:03:32,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:03:32,651 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:03:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:03:32,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:03:32,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:03:32,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:03:32,884 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:03:32,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:03:32,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:03:32,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:03:32,885 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 5 states. [2018-10-26 23:03:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:03:33,116 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-10-26 23:03:33,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:03:33,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-26 23:03:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:03:33,117 INFO L225 Difference]: With dead ends: 66 [2018-10-26 23:03:33,118 INFO L226 Difference]: Without dead ends: 64 [2018-10-26 23:03:33,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:03:33,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-26 23:03:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-10-26 23:03:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-26 23:03:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-10-26 23:03:33,122 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 19 [2018-10-26 23:03:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:03:33,127 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-10-26 23:03:33,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:03:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-10-26 23:03:33,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-26 23:03:33,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:03:33,127 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:03:33,128 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:03:33,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:03:33,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1262260482, now seen corresponding path program 1 times [2018-10-26 23:03:33,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:03:33,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:03:33,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:03:33,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:03:33,129 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:03:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:03:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:03:33,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:03:33,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:03:33,336 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:03:33,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:03:33,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:03:33,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:03:33,337 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2018-10-26 23:03:33,604 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2018-10-26 23:03:33,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:03:33,709 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-10-26 23:03:33,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:03:33,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-26 23:03:33,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:03:33,710 INFO L225 Difference]: With dead ends: 86 [2018-10-26 23:03:33,710 INFO L226 Difference]: Without dead ends: 58 [2018-10-26 23:03:33,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:03:33,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-26 23:03:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-10-26 23:03:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-26 23:03:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-10-26 23:03:33,716 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 19 [2018-10-26 23:03:33,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:03:33,717 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-10-26 23:03:33,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:03:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-10-26 23:03:33,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 23:03:33,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:03:33,718 INFO L375 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] [2018-10-26 23:03:33,718 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:03:33,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:03:33,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1770286947, now seen corresponding path program 1 times [2018-10-26 23:03:33,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:03:33,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:03:33,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:03:33,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:03:33,720 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:03:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:03:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:03:33,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:03:33,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:03:33,841 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:03:33,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:03:33,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:03:33,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:03:33,842 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 6 states. [2018-10-26 23:03:33,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:03:33,987 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-10-26 23:03:33,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:03:33,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-10-26 23:03:33,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:03:33,989 INFO L225 Difference]: With dead ends: 64 [2018-10-26 23:03:33,989 INFO L226 Difference]: Without dead ends: 62 [2018-10-26 23:03:33,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-10-26 23:03:33,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-26 23:03:33,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-10-26 23:03:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-26 23:03:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-10-26 23:03:33,995 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 23 [2018-10-26 23:03:33,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:03:33,996 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-10-26 23:03:33,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:03:33,996 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-10-26 23:03:33,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 23:03:33,997 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:03:33,997 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:03:33,997 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:03:33,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:03:33,998 INFO L82 PathProgramCache]: Analyzing trace with hash 813171697, now seen corresponding path program 1 times [2018-10-26 23:03:33,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:03:34,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:03:34,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:03:34,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:03:34,001 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:03:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:03:34,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:03:34,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:03:34,225 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:03:34,226 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-10-26 23:03:34,227 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [11], [14], [16], [20], [27], [31], [40], [44], [51], [55], [63], [65], [68], [97], [100], [101], [171], [172], [173] [2018-10-26 23:03:34,274 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:03:34,275 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:03:35,221 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:03:35,222 INFO L272 AbstractInterpreter]: Visited 23 different actions 45 times. Merged at 17 different actions 21 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 64 variables. [2018-10-26 23:03:35,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:03:35,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:03:35,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:03:35,235 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/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-10-26 23:03:35,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:03:35,243 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:03:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:03:35,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:03:35,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 23:03:35,375 INFO L477 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 3 [2018-10-26 23:03:35,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:35,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:35,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:35,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 23:03:35,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 23:03:35,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:03:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-26 23:03:35,477 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:03:35,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [6] total 10 [2018-10-26 23:03:35,477 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:03:35,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:03:35,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:03:35,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:03:35,478 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 5 states. [2018-10-26 23:03:35,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:03:35,603 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-10-26 23:03:35,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:03:35,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-10-26 23:03:35,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:03:35,604 INFO L225 Difference]: With dead ends: 60 [2018-10-26 23:03:35,604 INFO L226 Difference]: Without dead ends: 58 [2018-10-26 23:03:35,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-26 23:03:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-26 23:03:35,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-10-26 23:03:35,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-26 23:03:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-10-26 23:03:35,609 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 25 [2018-10-26 23:03:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:03:35,610 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-10-26 23:03:35,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:03:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-10-26 23:03:35,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 23:03:35,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:03:35,612 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:03:35,613 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:03:35,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:03:35,613 INFO L82 PathProgramCache]: Analyzing trace with hash 813208440, now seen corresponding path program 1 times [2018-10-26 23:03:35,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:03:35,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:03:35,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:03:35,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:03:35,614 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:03:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:03:35,999 WARN L179 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-10-26 23:03:36,198 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2018-10-26 23:03:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:03:36,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:03:36,289 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:03:36,289 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-10-26 23:03:36,289 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [11], [14], [16], [20], [27], [31], [40], [44], [51], [55], [63], [65], [70], [74], [77], [78], [171], [172], [173] [2018-10-26 23:03:36,291 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:03:36,291 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:03:36,870 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:03:36,871 INFO L272 AbstractInterpreter]: Visited 23 different actions 45 times. Merged at 17 different actions 21 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 64 variables. [2018-10-26 23:03:36,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:03:36,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:03:36,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:03:36,883 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/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-10-26 23:03:36,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:03:36,891 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:03:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:03:36,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:03:36,967 INFO L477 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-10-26 23:03:36,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,035 INFO L477 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 13 treesize of output 10 [2018-10-26 23:03:37,048 INFO L477 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 10 treesize of output 9 [2018-10-26 23:03:37,049 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,063 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,069 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2018-10-26 23:03:37,122 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:03:37,124 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:03:37,124 INFO L477 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 17 treesize of output 21 [2018-10-26 23:03:37,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-10-26 23:03:37,182 INFO L477 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-10-26 23:03:37,183 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,232 INFO L477 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 19 treesize of output 20 [2018-10-26 23:03:37,235 INFO L477 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-10-26 23:03:37,236 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,243 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,247 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,299 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:03:37,302 INFO L477 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 21 treesize of output 26 [2018-10-26 23:03:37,305 INFO L477 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 11 [2018-10-26 23:03:37,305 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,309 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:03:37,330 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:74, output treesize:42 [2018-10-26 23:03:37,418 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:03:37,419 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:03:37,422 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:03:37,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-10-26 23:03:37,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 111 [2018-10-26 23:03:37,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 23:03:37,468 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,535 INFO L477 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 66 [2018-10-26 23:03:37,540 INFO L477 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 56 treesize of output 44 [2018-10-26 23:03:37,541 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:03:37,645 INFO L477 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 41 treesize of output 31 [2018-10-26 23:03:37,645 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,666 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:03:37,671 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:03:37,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-10-26 23:03:37,688 INFO L477 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 10 treesize of output 9 [2018-10-26 23:03:37,688 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-10-26 23:03:37,707 INFO L477 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-10-26 23:03:37,707 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,725 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,729 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 23:03:37,757 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 10 variables, input treesize:183, output treesize:26 [2018-10-26 23:03:37,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-10-26 23:03:37,801 INFO L477 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 7 treesize of output 1 [2018-10-26 23:03:37,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,809 INFO L477 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-10-26 23:03:37,810 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:37,813 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-10-26 23:03:37,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:03:37,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:03:37,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 683 treesize of output 341 [2018-10-26 23:03:38,183 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-10-26 23:03:38,187 INFO L477 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 9 treesize of output 8 [2018-10-26 23:03:38,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:38,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 391 treesize of output 261 [2018-10-26 23:03:38,292 INFO L477 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 275 treesize of output 274 [2018-10-26 23:03:38,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:38,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 246 treesize of output 224 [2018-10-26 23:03:38,393 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-26 23:03:38,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 219 treesize of output 199 [2018-10-26 23:03:38,777 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 153 [2018-10-26 23:03:38,784 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:03:38,784 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:38,786 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:03:38,786 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:38,801 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:03:38,802 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:38,814 INFO L477 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 4 case distinctions, treesize of input 133 treesize of output 152 [2018-10-26 23:03:38,816 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-10-26 23:03:38,840 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:03:38,851 INFO L477 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 4 case distinctions, treesize of input 93 treesize of output 109 [2018-10-26 23:03:38,852 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-10-26 23:03:38,858 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:03:38,858 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:38,870 INFO L477 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 4 case distinctions, treesize of input 93 treesize of output 112 [2018-10-26 23:03:38,871 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-10-26 23:03:39,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 143 [2018-10-26 23:03:39,411 INFO L477 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 9 treesize of output 8 [2018-10-26 23:03:39,412 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:39,437 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:39,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 143 [2018-10-26 23:03:39,450 INFO L477 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 9 treesize of output 8 [2018-10-26 23:03:39,451 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:39,473 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:39,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 183 [2018-10-26 23:03:39,483 INFO L477 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 9 treesize of output 8 [2018-10-26 23:03:39,484 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:39,500 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:39,503 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:39,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 140 [2018-10-26 23:03:39,531 INFO L477 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 9 treesize of output 8 [2018-10-26 23:03:39,531 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:39,594 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:39,836 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:39,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 120 [2018-10-26 23:03:39,844 INFO L477 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 6 treesize of output 1 [2018-10-26 23:03:39,844 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:39,862 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:39,862 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:39,863 INFO L477 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 13 treesize of output 7 [2018-10-26 23:03:39,863 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:39,875 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:39,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 119 [2018-10-26 23:03:39,915 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:39,915 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:39,916 INFO L477 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 13 treesize of output 7 [2018-10-26 23:03:39,916 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:39,933 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-10-26 23:03:39,933 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:39,944 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:39,947 INFO L477 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 0 case distinctions, treesize of input 129 treesize of output 119 [2018-10-26 23:03:39,958 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:39,958 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:39,959 INFO L477 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 13 treesize of output 7 [2018-10-26 23:03:39,959 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:39,974 INFO L477 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 54 treesize of output 43 [2018-10-26 23:03:39,975 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:39,986 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:40,149 INFO L477 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 84 treesize of output 82 [2018-10-26 23:03:40,150 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:40,153 INFO L477 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 88 treesize of output 86 [2018-10-26 23:03:40,153 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:40,156 INFO L477 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 88 treesize of output 86 [2018-10-26 23:03:40,157 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:40,159 INFO L477 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 92 treesize of output 90 [2018-10-26 23:03:40,160 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:40,288 INFO L477 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 80 treesize of output 72 [2018-10-26 23:03:40,292 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:40,292 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:40,293 INFO L477 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 60 treesize of output 50 [2018-10-26 23:03:40,293 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:40,302 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:40,304 INFO L477 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 80 treesize of output 72 [2018-10-26 23:03:40,307 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:40,307 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:40,308 INFO L477 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 60 treesize of output 50 [2018-10-26 23:03:40,308 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:40,317 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:40,319 INFO L477 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 84 treesize of output 74 [2018-10-26 23:03:40,322 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:40,323 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:40,324 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:40,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 53 [2018-10-26 23:03:40,324 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:40,333 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:40,337 INFO L477 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 76 treesize of output 70 [2018-10-26 23:03:40,340 INFO L477 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 54 treesize of output 43 [2018-10-26 23:03:40,340 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:40,347 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:40,501 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-26 23:03:40,736 INFO L303 Elim1Store]: Index analysis took 234 ms [2018-10-26 23:03:40,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 215 treesize of output 197 [2018-10-26 23:03:41,046 WARN L179 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 147 [2018-10-26 23:03:41,054 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:41,062 INFO L477 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 2 case distinctions, treesize of input 131 treesize of output 139 [2018-10-26 23:03:41,063 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-10-26 23:03:41,068 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:41,076 INFO L477 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 2 case distinctions, treesize of input 91 treesize of output 99 [2018-10-26 23:03:41,077 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 2 xjuncts. [2018-10-26 23:03:41,081 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:41,090 INFO L477 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 2 case distinctions, treesize of input 91 treesize of output 99 [2018-10-26 23:03:41,090 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-10-26 23:03:41,093 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:03:41,093 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:41,487 INFO L477 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 88 treesize of output 86 [2018-10-26 23:03:41,487 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:41,490 INFO L477 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 84 treesize of output 82 [2018-10-26 23:03:41,491 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:41,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2018-10-26 23:03:41,738 INFO L477 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 54 treesize of output 43 [2018-10-26 23:03:41,739 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:41,751 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:41,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 72 [2018-10-26 23:03:41,757 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:41,758 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:41,759 INFO L477 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 60 treesize of output 50 [2018-10-26 23:03:41,759 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:41,799 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:42,001 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:42,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 136 [2018-10-26 23:03:42,007 INFO L477 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 9 treesize of output 8 [2018-10-26 23:03:42,008 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:42,060 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:42,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 148 [2018-10-26 23:03:42,074 INFO L477 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 130 treesize of output 129 [2018-10-26 23:03:42,074 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:42,097 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:42,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 148 [2018-10-26 23:03:42,112 INFO L477 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 130 treesize of output 129 [2018-10-26 23:03:42,113 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:42,137 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:42,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 138 [2018-10-26 23:03:42,295 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:42,343 INFO L477 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 152 treesize of output 138 [2018-10-26 23:03:42,343 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:42,367 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:42,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 142 [2018-10-26 23:03:42,390 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:42,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 123 [2018-10-26 23:03:42,552 INFO L477 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 107 treesize of output 101 [2018-10-26 23:03:42,553 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:42,628 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:42,628 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:42,629 INFO L477 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 114 treesize of output 101 [2018-10-26 23:03:42,629 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:42,656 INFO L267 ElimStorePlain]: Start of recursive call 62: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:03:42,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 123 [2018-10-26 23:03:42,670 INFO L477 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 107 treesize of output 101 [2018-10-26 23:03:42,671 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:42,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 106 [2018-10-26 23:03:42,707 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 2 xjuncts. [2018-10-26 23:03:43,110 INFO L267 ElimStorePlain]: Start of recursive call 65: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 23:03:43,113 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:43,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 123 [2018-10-26 23:03:43,118 INFO L477 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 6 treesize of output 1 [2018-10-26 23:03:43,118 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-10-26 23:03:43,131 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:03:43,225 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-26 23:03:43,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 274 treesize of output 238 [2018-10-26 23:03:43,414 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-26 23:03:53,122 WARN L179 SmtUtils]: Spent 9.68 s on a formula simplification. DAG size of input: 977 DAG size of output: 783 [2018-10-26 23:03:53,144 INFO L477 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 113 treesize of output 97 [2018-10-26 23:03:53,150 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:53,159 INFO L477 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 4 case distinctions, treesize of input 31 treesize of output 46 [2018-10-26 23:03:53,160 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 4 xjuncts. [2018-10-26 23:03:53,204 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 23:03:53,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 97 [2018-10-26 23:03:53,214 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:53,223 INFO L477 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 4 case distinctions, treesize of input 31 treesize of output 46 [2018-10-26 23:03:53,224 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 4 xjuncts. [2018-10-26 23:03:53,304 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 23:03:53,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 137 [2018-10-26 23:03:53,314 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:03:53,324 INFO L477 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 4 case distinctions, treesize of input 31 treesize of output 46 [2018-10-26 23:03:53,325 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 4 xjuncts. [2018-10-26 23:03:53,372 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 23:03:53,402 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:03:53,403 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:02,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 98 [2018-10-26 23:04:02,432 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:04:02,433 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_68 term size 27 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) 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.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) 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:216) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-10-26 23:04:02,444 INFO L168 Benchmark]: Toolchain (without parser) took 31983.98 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 629.7 MB). Free memory was 953.1 MB in the beginning and 1.5 GB in the end (delta: -567.7 MB). Peak memory consumption was 719.8 MB. Max. memory is 11.5 GB. [2018-10-26 23:04:02,444 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:04:02,444 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.79 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 928.9 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-26 23:04:02,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 104.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 928.9 MB in the beginning and 1.2 GB in the end (delta: -242.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-10-26 23:04:02,444 INFO L168 Benchmark]: Boogie Preprocessor took 37.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-10-26 23:04:02,444 INFO L168 Benchmark]: RCFGBuilder took 662.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. [2018-10-26 23:04:02,445 INFO L168 Benchmark]: TraceAbstraction took 30805.18 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 456.1 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -391.2 MB). Peak memory consumption was 722.7 MB. Max. memory is 11.5 GB. [2018-10-26 23:04:02,446 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.37 ms. Allocated memory is still 1.0 GB. Free memory is still 980.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 370.79 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 928.9 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 104.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.5 MB). Free memory was 928.9 MB in the beginning and 1.2 GB in the end (delta: -242.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 662.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30805.18 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 456.1 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -391.2 MB). Peak memory consumption was 722.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_68 term size 27 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_68 term size 27: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-26 23:04:04,258 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:04:04,260 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:04:04,269 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:04:04,269 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:04:04,270 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:04:04,271 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:04:04,273 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:04:04,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:04:04,275 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:04:04,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:04:04,276 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:04:04,276 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:04:04,277 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:04:04,278 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:04:04,279 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:04:04,280 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:04:04,281 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:04:04,283 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:04:04,284 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:04:04,285 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:04:04,286 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:04:04,288 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:04:04,289 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:04:04,289 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:04:04,289 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:04:04,291 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:04:04,291 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:04:04,292 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:04:04,293 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:04:04,293 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:04:04,294 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:04:04,294 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:04:04,294 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:04:04,295 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:04:04,296 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:04:04,296 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 23:04:04,308 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:04:04,308 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:04:04,309 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:04:04,309 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 23:04:04,309 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 23:04:04,309 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 23:04:04,309 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 23:04:04,309 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 23:04:04,310 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:04:04,310 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:04:04,311 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:04:04,311 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:04:04,311 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:04:04,312 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:04:04,312 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:04:04,312 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 23:04:04,312 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 23:04:04,312 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:04:04,312 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:04:04,312 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:04:04,313 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:04:04,313 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 23:04:04,313 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:04:04,313 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 23:04:04,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 23:04:04,313 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:04:04,313 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:04:04,314 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:04:04,314 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 23:04:04,314 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:04:04,314 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 23:04:04,316 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 23:04:04,316 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_ab6be8bb-acaa-4810-860f-907accfcd4a4/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 -> 8b88a605df784da4b84aa984e355b57373efff76 [2018-10-26 23:04:04,349 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:04:04,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:04:04,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:04:04,363 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:04:04,363 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:04:04,364 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/../../sv-benchmarks/c/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i [2018-10-26 23:04:04,414 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/data/db4995c92/96a255f36d904c78b6c34909e1f1d403/FLAG5ca4d7075 [2018-10-26 23:04:04,823 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:04:04,823 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/sv-benchmarks/c/forester-heap/dll-token_true-unreach-call_true-valid-memsafety.i [2018-10-26 23:04:04,840 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/data/db4995c92/96a255f36d904c78b6c34909e1f1d403/FLAG5ca4d7075 [2018-10-26 23:04:04,853 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/data/db4995c92/96a255f36d904c78b6c34909e1f1d403 [2018-10-26 23:04:04,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:04:04,861 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 23:04:04,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:04:04,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:04:04,868 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:04:04,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:04:04" (1/1) ... [2018-10-26 23:04:04,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78109daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:04:04, skipping insertion in model container [2018-10-26 23:04:04,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:04:04" (1/1) ... [2018-10-26 23:04:04,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:04:04,933 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:04:05,221 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:04:05,234 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:04:05,299 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:04:05,348 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:04:05,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:04:05 WrapperNode [2018-10-26 23:04:05,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:04:05,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 23:04:05,350 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 23:04:05,350 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 23:04:05,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:04:05" (1/1) ... [2018-10-26 23:04:05,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:04:05" (1/1) ... [2018-10-26 23:04:05,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 23:04:05,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:04:05,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:04:05,404 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:04:05,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:04:05" (1/1) ... [2018-10-26 23:04:05,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:04:05" (1/1) ... [2018-10-26 23:04:05,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:04:05" (1/1) ... [2018-10-26 23:04:05,418 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:04:05" (1/1) ... [2018-10-26 23:04:05,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:04:05" (1/1) ... [2018-10-26 23:04:05,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:04:05" (1/1) ... [2018-10-26 23:04:05,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:04:05" (1/1) ... [2018-10-26 23:04:05,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:04:05,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:04:05,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:04:05,506 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:04:05,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:04:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/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-10-26 23:04:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 23:04:05,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 23:04:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 23:04:05,558 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 23:04:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:04:05,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:04:06,196 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:04:06,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:04:06 BoogieIcfgContainer [2018-10-26 23:04:06,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:04:06,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 23:04:06,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 23:04:06,200 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 23:04:06,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 11:04:04" (1/3) ... [2018-10-26 23:04:06,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63bb46ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:04:06, skipping insertion in model container [2018-10-26 23:04:06,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:04:05" (2/3) ... [2018-10-26 23:04:06,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63bb46ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:04:06, skipping insertion in model container [2018-10-26 23:04:06,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:04:06" (3/3) ... [2018-10-26 23:04:06,203 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token_true-unreach-call_true-valid-memsafety.i [2018-10-26 23:04:06,211 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 23:04:06,218 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-10-26 23:04:06,230 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-10-26 23:04:06,251 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 23:04:06,252 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 23:04:06,252 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 23:04:06,252 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 23:04:06,252 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 23:04:06,252 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 23:04:06,252 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 23:04:06,253 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 23:04:06,253 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 23:04:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2018-10-26 23:04:06,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-26 23:04:06,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:04:06,273 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:04:06,276 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:04:06,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:04:06,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1955697552, now seen corresponding path program 1 times [2018-10-26 23:04:06,285 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:04:06,285 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/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-10-26 23:04:06,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:04:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:04:06,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:04:06,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:04:06,382 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:04:06,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:04:06,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-26 23:04:06,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-26 23:04:06,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-26 23:04:06,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 23:04:06,404 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 2 states. [2018-10-26 23:04:06,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:04:06,423 INFO L93 Difference]: Finished difference Result 100 states and 146 transitions. [2018-10-26 23:04:06,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-26 23:04:06,424 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-10-26 23:04:06,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:04:06,431 INFO L225 Difference]: With dead ends: 100 [2018-10-26 23:04:06,431 INFO L226 Difference]: Without dead ends: 47 [2018-10-26 23:04:06,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-26 23:04:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-26 23:04:06,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-26 23:04:06,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-26 23:04:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-10-26 23:04:06,466 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 11 [2018-10-26 23:04:06,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:04:06,467 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-10-26 23:04:06,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-26 23:04:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-10-26 23:04:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-26 23:04:06,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:04:06,468 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:04:06,469 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:04:06,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:04:06,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1929100148, now seen corresponding path program 1 times [2018-10-26 23:04:06,470 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:04:06,470 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/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-10-26 23:04:06,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:04:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:04:06,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:04:06,640 INFO L477 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-10-26 23:04:06,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:06,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:06,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-26 23:04:06,783 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:04:06,803 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:04:06,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-10-26 23:04:06,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:06,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-10-26 23:04:06,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 23:04:06,894 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:06,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 23:04:07,015 INFO L477 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-10-26 23:04:07,015 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:07,019 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:07,021 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:07,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:07,105 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:48, output treesize:4 [2018-10-26 23:04:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:04:07,188 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:04:07,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:04:07,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:04:07,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:04:07,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:04:07,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:04:07,193 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 4 states. [2018-10-26 23:04:07,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:04:07,442 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-10-26 23:04:07,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:04:07,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-10-26 23:04:07,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:04:07,444 INFO L225 Difference]: With dead ends: 47 [2018-10-26 23:04:07,444 INFO L226 Difference]: Without dead ends: 45 [2018-10-26 23:04:07,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:04:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-26 23:04:07,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-26 23:04:07,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-26 23:04:07,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-10-26 23:04:07,451 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 11 [2018-10-26 23:04:07,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:04:07,451 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-10-26 23:04:07,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:04:07,451 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-10-26 23:04:07,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-26 23:04:07,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:04:07,455 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:04:07,456 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:04:07,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:04:07,456 INFO L82 PathProgramCache]: Analyzing trace with hash -328667837, now seen corresponding path program 1 times [2018-10-26 23:04:07,456 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:04:07,457 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/cvc4nyu Starting monitored process 4 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 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:04:07,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:04:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:04:07,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:04:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:04:07,552 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:04:07,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:04:07,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:04:07,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:04:07,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:04:07,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:04:07,555 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 4 states. [2018-10-26 23:04:07,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:04:07,779 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-10-26 23:04:07,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:04:07,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-10-26 23:04:07,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:04:07,783 INFO L225 Difference]: With dead ends: 74 [2018-10-26 23:04:07,783 INFO L226 Difference]: Without dead ends: 72 [2018-10-26 23:04:07,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-10-26 23:04:07,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-26 23:04:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 43. [2018-10-26 23:04:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-26 23:04:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-10-26 23:04:07,794 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 12 [2018-10-26 23:04:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:04:07,795 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-10-26 23:04:07,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:04:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-10-26 23:04:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-26 23:04:07,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:04:07,797 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:04:07,797 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:04:07,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:04:07,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2059878822, now seen corresponding path program 1 times [2018-10-26 23:04:07,799 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:04:07,799 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/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-10-26 23:04:07,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:04:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:04:07,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:04:07,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 23:04:07,979 INFO L477 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 13 treesize of output 5 [2018-10-26 23:04:07,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:07,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:07,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:07,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-10-26 23:04:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:04:07,991 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:04:07,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:04:07,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:04:07,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:04:07,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:04:07,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:04:07,995 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 5 states. [2018-10-26 23:04:08,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:04:08,162 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-10-26 23:04:08,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:04:08,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-26 23:04:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:04:08,163 INFO L225 Difference]: With dead ends: 43 [2018-10-26 23:04:08,163 INFO L226 Difference]: Without dead ends: 41 [2018-10-26 23:04:08,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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-10-26 23:04:08,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-26 23:04:08,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-26 23:04:08,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-26 23:04:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-10-26 23:04:08,169 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 18 [2018-10-26 23:04:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:04:08,169 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-10-26 23:04:08,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:04:08,170 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-10-26 23:04:08,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-26 23:04:08,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:04:08,170 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:04:08,171 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:04:08,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:04:08,171 INFO L82 PathProgramCache]: Analyzing trace with hash 2059915565, now seen corresponding path program 1 times [2018-10-26 23:04:08,171 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:04:08,172 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/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-10-26 23:04:08,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:04:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:04:08,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:04:08,282 INFO L477 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-10-26 23:04:08,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:08,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:08,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-10-26 23:04:08,342 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:04:08,346 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:04:08,347 INFO L477 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 13 treesize of output 4 [2018-10-26 23:04:08,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:08,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 60 [2018-10-26 23:04:08,484 INFO L477 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-10-26 23:04:08,484 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:08,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-10-26 23:04:08,532 INFO L477 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 37 treesize of output 27 [2018-10-26 23:04:08,532 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:08,536 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:08,540 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:08,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-10-26 23:04:08,573 INFO L477 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-10-26 23:04:08,574 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:08,590 INFO L477 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 19 treesize of output 20 [2018-10-26 23:04:08,593 INFO L477 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-10-26 23:04:08,593 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:08,600 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:08,607 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:08,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:08,618 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:99, output treesize:11 [2018-10-26 23:04:08,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 23:04:08,650 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:04:08,650 INFO L477 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 13 treesize of output 9 [2018-10-26 23:04:08,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:08,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:08,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:08,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:7 [2018-10-26 23:04:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:04:08,771 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:04:08,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:04:08,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:04:08,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:04:08,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:04:08,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:04:08,774 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 5 states. [2018-10-26 23:04:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:04:09,111 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-10-26 23:04:09,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:04:09,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-26 23:04:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:04:09,112 INFO L225 Difference]: With dead ends: 80 [2018-10-26 23:04:09,112 INFO L226 Difference]: Without dead ends: 54 [2018-10-26 23:04:09,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:04:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-26 23:04:09,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-10-26 23:04:09,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-26 23:04:09,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-10-26 23:04:09,119 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 18 [2018-10-26 23:04:09,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:04:09,120 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-10-26 23:04:09,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:04:09,120 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-10-26 23:04:09,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 23:04:09,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:04:09,121 INFO L375 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] [2018-10-26 23:04:09,122 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:04:09,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:04:09,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1674389966, now seen corresponding path program 1 times [2018-10-26 23:04:09,122 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:04:09,123 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/bin-2019/utaipan/cvc4nyu Starting monitored process 7 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 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:04:09,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:04:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:04:09,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:04:09,251 INFO L477 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 25 treesize of output 18 [2018-10-26 23:04:09,254 INFO L477 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 18 treesize of output 17 [2018-10-26 23:04:09,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:09,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:09,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:09,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:21 [2018-10-26 23:04:09,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-26 23:04:09,293 INFO L477 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 21 treesize of output 13 [2018-10-26 23:04:09,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:09,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:09,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-10-26 23:04:09,311 INFO L477 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 17 treesize of output 9 [2018-10-26 23:04:09,311 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:09,314 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:09,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:09,317 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:9 [2018-10-26 23:04:09,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 23:04:09,363 INFO L477 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 13 treesize of output 5 [2018-10-26 23:04:09,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:09,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:09,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:09,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-10-26 23:04:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:04:09,378 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 23:04:09,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:04:09,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:04:09,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:04:09,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:04:09,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:04:09,384 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 6 states. [2018-10-26 23:04:09,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:04:09,698 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-10-26 23:04:09,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:04:09,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-10-26 23:04:09,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:04:09,701 INFO L225 Difference]: With dead ends: 60 [2018-10-26 23:04:09,701 INFO L226 Difference]: Without dead ends: 58 [2018-10-26 23:04:09,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 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-10-26 23:04:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-26 23:04:09,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-10-26 23:04:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-26 23:04:09,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-10-26 23:04:09,705 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 22 [2018-10-26 23:04:09,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:04:09,706 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-10-26 23:04:09,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:04:09,706 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-10-26 23:04:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 23:04:09,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:04:09,707 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:04:09,708 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:04:09,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:04:09,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2083477930, now seen corresponding path program 1 times [2018-10-26 23:04:09,708 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 23:04:09,708 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ab6be8bb-acaa-4810-860f-907accfcd4a4/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-10-26 23:04:09,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:04:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:04:09,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:04:09,901 INFO L477 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-10-26 23:04:09,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:09,923 INFO L477 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 13 treesize of output 10 [2018-10-26 23:04:09,927 INFO L477 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 10 treesize of output 9 [2018-10-26 23:04:09,927 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:09,929 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:09,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:09,948 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-10-26 23:04:09,988 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:04:09,993 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:04:09,993 INFO L477 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 17 treesize of output 21 [2018-10-26 23:04:09,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:10,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-10-26 23:04:10,130 INFO L477 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-10-26 23:04:10,130 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:10,163 INFO L477 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 19 treesize of output 20 [2018-10-26 23:04:10,167 INFO L477 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-10-26 23:04:10,168 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:10,179 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:10,189 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:10,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-10-26 23:04:10,287 INFO L477 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 5 treesize of output 1 [2018-10-26 23:04:10,288 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:10,299 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:10,337 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:04:10,345 INFO L477 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 21 treesize of output 26 [2018-10-26 23:04:10,349 INFO L477 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 11 [2018-10-26 23:04:10,350 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:10,362 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:10,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:10,404 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 9 variables, input treesize:81, output treesize:44 [2018-10-26 23:04:10,490 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:04:10,494 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:04:10,498 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 23:04:10,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-10-26 23:04:10,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:10,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 111 [2018-10-26 23:04:10,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-26 23:04:10,691 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:10,742 INFO L477 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 66 [2018-10-26 23:04:10,747 INFO L477 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 39 [2018-10-26 23:04:10,748 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:10,777 INFO L477 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 52 treesize of output 40 [2018-10-26 23:04:10,777 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:04:10,802 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:04:10,824 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:04:10,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2018-10-26 23:04:10,900 INFO L477 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 10 treesize of output 9 [2018-10-26 23:04:10,900 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:10,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-10-26 23:04:10,937 INFO L477 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-10-26 23:04:10,938 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:10,953 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:10,963 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:10,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 23:04:10,993 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 9 variables, input treesize:185, output treesize:24 [2018-10-26 23:04:11,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-10-26 23:04:11,050 INFO L477 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 9 treesize of output 1 [2018-10-26 23:04:11,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:11,062 INFO L477 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-10-26 23:04:11,062 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:11,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:11,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 23:04:11,070 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2018-10-26 23:04:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:04:11,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:04:13,164 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_main_write~intINTTYPE4_#value_5| (_ BitVec 32)) (|v_main_write~$Pointer$_#value.base_7| (_ BitVec 32)) (|v_main_write~$Pointer$_#ptr.offset_7| (_ BitVec 32)) (|v_main_write~intINTTYPE4_#ptr.offset_5| (_ BitVec 32)) (|v_main_#Ultimate.alloc_#res.base_4| (_ BitVec 32))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| c_main_~x~0.base (store (select |c_#memory_int| c_main_~x~0.base) (bvadd c_main_~x~0.offset (_ bv8 32)) (_ bv1 32)))) (.cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| c_main_~x~0.base (store (select |c_#memory_$Pointer$.base| c_main_~x~0.base) c_main_~x~0.offset |v_main_#Ultimate.alloc_#res.base_4|)))) (store .cse2 |v_main_#Ultimate.alloc_#res.base_4| (store (select .cse2 |v_main_#Ultimate.alloc_#res.base_4|) |v_main_write~$Pointer$_#ptr.offset_7| |v_main_write~$Pointer$_#value.base_7|))) c_main_~x~0.base) c_main_~x~0.offset))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_main_write~intINTTYPE4_#ptr.offset_5| |v_main_write~intINTTYPE4_#value_5|))) c_main_~head~0.base) (bvadd c_main_~head~0.offset (_ bv8 32))) (_ bv0 32)) (not (= (select |c_#valid| |v_main_#Ultimate.alloc_#res.base_4|) (_ bv0 1))))) is different from false [2018-10-26 23:04:13,204 INFO L477 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 715 treesize of output 699 [2018-10-26 23:04:13,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 699 treesize of output 683 [2018-10-26 23:04:13,214 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:04:13,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 23:04:13,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 683 treesize of output 341 [2018-10-26 23:04:14,121 WARN L179 SmtUtils]: Spent 663.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-10-26 23:04:14,130 INFO L477 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 9 treesize of output 8 [2018-10-26 23:04:14,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:14,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 391 treesize of output 261 [2018-10-26 23:04:14,632 INFO L477 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 275 treesize of output 274 [2018-10-26 23:04:14,632 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 23:04:16,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 246 treesize of output 224 [2018-10-26 23:04:16,147 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-26 23:04:18,521 INFO L303 Elim1Store]: Index analysis took 563 ms [2018-10-26 23:04:18,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 274 treesize of output 238 [2018-10-26 23:04:18,958 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-26 23:06:14,458 WARN L179 SmtUtils]: Spent 1.92 m on a formula simplification. DAG size of input: 988 DAG size of output: 810 [2018-10-26 23:06:14,561 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:14,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 156 treesize of output 161 [2018-10-26 23:06:14,791 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:14,791 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:14,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 160 [2018-10-26 23:06:14,793 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 23:06:15,739 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:15,740 INFO L477 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 134 treesize of output 130 [2018-10-26 23:06:15,740 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-26 23:06:16,464 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:16,465 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:16,466 INFO L477 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 144 treesize of output 145 [2018-10-26 23:06:16,467 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-26 23:06:17,230 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:17,250 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:17,252 INFO L477 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 144 treesize of output 152 [2018-10-26 23:06:17,253 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-26 23:06:18,125 INFO L267 ElimStorePlain]: Start of recursive call 10: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 23:06:18,251 INFO L303 Elim1Store]: Index analysis took 124 ms [2018-10-26 23:06:18,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 118 [2018-10-26 23:06:18,348 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:18,349 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:18,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 117 [2018-10-26 23:06:18,351 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-26 23:06:19,086 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:19,086 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:19,087 INFO L477 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 101 treesize of output 109 [2018-10-26 23:06:19,088 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-26 23:06:19,651 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:19,652 INFO L477 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 91 treesize of output 87 [2018-10-26 23:06:19,652 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-26 23:06:20,149 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:20,150 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:20,151 INFO L477 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 101 treesize of output 102 [2018-10-26 23:06:20,151 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-10-26 23:06:20,751 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 23:06:20,754 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 23:06:20,754 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-26 23:06:20,806 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:20,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 108 treesize of output 121 [2018-10-26 23:06:20,890 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:20,891 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:20,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 120 [2018-10-26 23:06:20,893 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-26 23:06:21,833 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:21,834 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:21,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 112 [2018-10-26 23:06:21,835 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-10-26 23:06:22,425 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:22,426 INFO L477 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 94 treesize of output 90 [2018-10-26 23:06:22,427 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-10-26 23:06:23,070 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:23,070 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:06:23,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 105 [2018-10-26 23:06:23,072 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-10-26 23:06:23,556 INFO L267 ElimStorePlain]: Start of recursive call 21: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-26 23:08:11,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 168 [2018-10-26 23:08:11,816 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-10-26 23:08:11,884 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:08:11,984 INFO L303 Elim1Store]: Index analysis took 167 ms [2018-10-26 23:08:12,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 161 [2018-10-26 23:08:12,029 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-26 23:08:12,178 INFO L303 Elim1Store]: Index analysis took 148 ms [2018-10-26 23:08:12,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 168 [2018-10-26 23:08:12,262 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-10-26 23:09:09,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 134 [2018-10-26 23:09:09,897 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:09:09,898 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 23:09:10,099 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 23:09:10,100 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimCell_44 term size 60 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) 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.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) 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.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-10-26 23:09:10,102 INFO L168 Benchmark]: Toolchain (without parser) took 305242.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 244.8 MB). Free memory was 946.5 MB in the beginning and 1.2 GB in the end (delta: -281.4 MB). Peak memory consumption was 377.2 MB. Max. memory is 11.5 GB. [2018-10-26 23:09:10,103 INFO L168 Benchmark]: CDTParser took 0.16 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-10-26 23:09:10,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 486.68 ms. Allocated memory is still 1.0 GB. Free memory was 946.5 MB in the beginning and 925.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-26 23:09:10,103 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.32 ms. Allocated memory is still 1.0 GB. Free memory was 925.1 MB in the beginning and 919.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-10-26 23:09:10,104 INFO L168 Benchmark]: Boogie Preprocessor took 101.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 919.7 MB in the beginning and 1.2 GB in the end (delta: -250.3 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-10-26 23:09:10,104 INFO L168 Benchmark]: RCFGBuilder took 691.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. [2018-10-26 23:09:10,104 INFO L168 Benchmark]: TraceAbstraction took 303904.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -97.2 MB). Peak memory consumption was 383.6 MB. Max. memory is 11.5 GB. [2018-10-26 23:09:10,106 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 486.68 ms. Allocated memory is still 1.0 GB. Free memory was 946.5 MB in the beginning and 925.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.32 ms. Allocated memory is still 1.0 GB. Free memory was 925.1 MB in the beginning and 919.7 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 101.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.7 MB). Free memory was 919.7 MB in the beginning and 1.2 GB in the end (delta: -250.3 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 691.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 303904.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -97.2 MB). Peak memory consumption was 383.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimCell_44 term size 60 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimCell_44 term size 60: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...