./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test22_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/test22_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/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 efd11941ceab8dc56d9aa56f1950f714738654ba ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/test22_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/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 efd11941ceab8dc56d9aa56f1950f714738654ba ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 08:29:56,872 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 08:29:56,873 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 08:29:56,880 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 08:29:56,880 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 08:29:56,881 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 08:29:56,881 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 08:29:56,883 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 08:29:56,884 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 08:29:56,884 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 08:29:56,885 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 08:29:56,885 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 08:29:56,886 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 08:29:56,886 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 08:29:56,887 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 08:29:56,887 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 08:29:56,888 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 08:29:56,889 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 08:29:56,890 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 08:29:56,891 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 08:29:56,892 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 08:29:56,893 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 08:29:56,894 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 08:29:56,895 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 08:29:56,895 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 08:29:56,895 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 08:29:56,896 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 08:29:56,897 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 08:29:56,897 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 08:29:56,898 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 08:29:56,898 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 08:29:56,899 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 08:29:56,899 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 08:29:56,899 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 08:29:56,899 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 08:29:56,900 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 08:29:56,900 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 08:29:56,910 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 08:29:56,910 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 08:29:56,911 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 08:29:56,911 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 08:29:56,911 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 08:29:56,911 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 08:29:56,912 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 08:29:56,912 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 08:29:56,912 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 08:29:56,912 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 08:29:56,912 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 08:29:56,912 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 08:29:56,912 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 08:29:56,913 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 08:29:56,913 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 08:29:56,913 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 08:29:56,913 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 08:29:56,913 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 08:29:56,914 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 08:29:56,914 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 08:29:56,914 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 08:29:56,914 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 08:29:56,914 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 08:29:56,914 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 08:29:56,914 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 08:29:56,914 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 08:29:56,915 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 08:29:56,915 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 08:29:56,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 08:29:56,915 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 08:29:56,915 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 08:29:56,915 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 08:29:56,915 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 08:29:56,916 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 08:29:56,916 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 08:29:56,916 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 08:29:56,916 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_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/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 -> efd11941ceab8dc56d9aa56f1950f714738654ba [2018-12-09 08:29:56,940 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 08:29:56,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 08:29:56,949 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 08:29:56,950 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 08:29:56,950 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 08:29:56,951 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/test22_true-unreach-call.c [2018-12-09 08:29:56,997 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/data/d2bb8b378/24b6f176f8af42adb2739d3cde3a03fe/FLAGb7325b85e [2018-12-09 08:29:57,290 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 08:29:57,290 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/sv-benchmarks/c/ldv-regression/test22_true-unreach-call.c [2018-12-09 08:29:57,294 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/data/d2bb8b378/24b6f176f8af42adb2739d3cde3a03fe/FLAGb7325b85e [2018-12-09 08:29:57,302 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/data/d2bb8b378/24b6f176f8af42adb2739d3cde3a03fe [2018-12-09 08:29:57,304 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 08:29:57,305 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 08:29:57,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 08:29:57,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 08:29:57,308 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 08:29:57,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:29:57" (1/1) ... [2018-12-09 08:29:57,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28bd7f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:29:57, skipping insertion in model container [2018-12-09 08:29:57,310 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:29:57" (1/1) ... [2018-12-09 08:29:57,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 08:29:57,324 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 08:29:57,412 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:29:57,418 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 08:29:57,428 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:29:57,437 INFO L195 MainTranslator]: Completed translation [2018-12-09 08:29:57,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:29:57 WrapperNode [2018-12-09 08:29:57,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 08:29:57,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 08:29:57,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 08:29:57,438 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 08:29:57,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:29:57" (1/1) ... [2018-12-09 08:29:57,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:29:57" (1/1) ... [2018-12-09 08:29:57,452 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 08:29:57,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 08:29:57,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 08:29:57,452 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 08:29:57,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:29:57" (1/1) ... [2018-12-09 08:29:57,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:29:57" (1/1) ... [2018-12-09 08:29:57,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:29:57" (1/1) ... [2018-12-09 08:29:57,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:29:57" (1/1) ... [2018-12-09 08:29:57,499 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:29:57" (1/1) ... [2018-12-09 08:29:57,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:29:57" (1/1) ... [2018-12-09 08:29:57,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:29:57" (1/1) ... [2018-12-09 08:29:57,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 08:29:57,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 08:29:57,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 08:29:57,506 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 08:29:57,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:29:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/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-12-09 08:29:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-12-09 08:29:57,538 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-12-09 08:29:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 08:29:57,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 08:29:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-09 08:29:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-12-09 08:29:57,538 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-12-09 08:29:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 08:29:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 08:29:57,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 08:29:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 08:29:57,538 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-12-09 08:29:57,538 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-12-09 08:29:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 08:29:57,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 08:29:57,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 08:29:57,658 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 08:29:57,658 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 08:29:57,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:29:57 BoogieIcfgContainer [2018-12-09 08:29:57,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 08:29:57,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 08:29:57,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 08:29:57,661 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 08:29:57,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:29:57" (1/3) ... [2018-12-09 08:29:57,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d6a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:29:57, skipping insertion in model container [2018-12-09 08:29:57,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:29:57" (2/3) ... [2018-12-09 08:29:57,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d6a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:29:57, skipping insertion in model container [2018-12-09 08:29:57,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:29:57" (3/3) ... [2018-12-09 08:29:57,664 INFO L112 eAbstractionObserver]: Analyzing ICFG test22_true-unreach-call.c [2018-12-09 08:29:57,672 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 08:29:57,677 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 08:29:57,691 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 08:29:57,713 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 08:29:57,713 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 08:29:57,713 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 08:29:57,713 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 08:29:57,713 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 08:29:57,713 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 08:29:57,714 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 08:29:57,714 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 08:29:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-12-09 08:29:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 08:29:57,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:29:57,727 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:29:57,728 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:29:57,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:29:57,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1838243936, now seen corresponding path program 1 times [2018-12-09 08:29:57,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:29:57,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:29:57,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:29:57,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:29:57,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:29:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:29:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 08:29:57,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:29:57,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 08:29:57,850 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:29:57,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 08:29:57,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 08:29:57,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 08:29:57,862 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-12-09 08:29:57,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:29:57,874 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-12-09 08:29:57,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 08:29:57,876 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-12-09 08:29:57,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:29:57,883 INFO L225 Difference]: With dead ends: 49 [2018-12-09 08:29:57,883 INFO L226 Difference]: Without dead ends: 31 [2018-12-09 08:29:57,886 INFO L631 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-12-09 08:29:57,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-09 08:29:57,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-09 08:29:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-09 08:29:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-12-09 08:29:57,910 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 37 [2018-12-09 08:29:57,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:29:57,911 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-12-09 08:29:57,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 08:29:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-12-09 08:29:57,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 08:29:57,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:29:57,912 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:29:57,913 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:29:57,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:29:57,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1291679579, now seen corresponding path program 1 times [2018-12-09 08:29:57,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:29:57,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:29:57,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:29:57,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:29:57,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:29:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:29:58,074 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:29:58,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:29:58,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 08:29:58,075 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-12-09 08:29:58,076 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [3], [6], [10], [11], [17], [19], [21], [24], [30], [35], [38], [45], [48], [55], [58], [59], [60], [61], [62], [64], [65], [66], [67], [68], [69], [70], [71], [72], [73] [2018-12-09 08:29:58,097 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 08:29:58,097 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 08:29:58,214 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 08:29:58,215 INFO L272 AbstractInterpreter]: Visited 32 different actions 38 times. Never merged. Never widened. Performed 306 root evaluator evaluations with a maximum evaluation depth of 5. Performed 306 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Never found a fixpoint. Largest state had 39 variables. [2018-12-09 08:29:58,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:29:58,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 08:29:58,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:29:58,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/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-12-09 08:29:58,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:29:58,227 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 08:29:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:29:58,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:29:58,354 INFO L478 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 21 treesize of output 17 [2018-12-09 08:29:58,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 08:29:58,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:29:58,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:29:58,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-09 08:29:58,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 08:29:58,372 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:29:58,375 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:29:58,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:29:58,385 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:43, output treesize:5 [2018-12-09 08:29:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 08:29:58,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:29:58,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2018-12-09 08:29:58,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-09 08:29:58,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:29:58,431 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:29:58,432 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:29:58,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 08:29:58,433 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 08:29:58,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:29:58,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:29:58,440 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:13, output treesize:7 [2018-12-09 08:29:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 08:29:58,485 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 08:29:58,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [10] total 16 [2018-12-09 08:29:58,485 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 08:29:58,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:29:58,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:29:58,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-12-09 08:29:58,487 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-12-09 08:29:58,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:29:58,567 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-12-09 08:29:58,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 08:29:58,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-12-09 08:29:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:29:58,568 INFO L225 Difference]: With dead ends: 42 [2018-12-09 08:29:58,568 INFO L226 Difference]: Without dead ends: 34 [2018-12-09 08:29:58,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-12-09 08:29:58,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-09 08:29:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-09 08:29:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 08:29:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-09 08:29:58,573 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 38 [2018-12-09 08:29:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:29:58,573 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-09 08:29:58,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:29:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-12-09 08:29:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 08:29:58,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:29:58,574 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:29:58,574 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:29:58,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:29:58,574 INFO L82 PathProgramCache]: Analyzing trace with hash -142788074, now seen corresponding path program 1 times [2018-12-09 08:29:58,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:29:58,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:29:58,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:29:58,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:29:58,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:29:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:29:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:29:58,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:29:58,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 08:29:58,723 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-12-09 08:29:58,723 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [3], [6], [10], [11], [17], [19], [21], [24], [30], [35], [38], [40], [45], [48], [55], [58], [59], [60], [61], [62], [64], [65], [66], [67], [68], [69], [70], [71], [72], [73] [2018-12-09 08:29:58,725 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 08:29:58,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 08:29:58,766 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 08:29:58,766 INFO L272 AbstractInterpreter]: Visited 33 different actions 39 times. Never merged. Never widened. Performed 310 root evaluator evaluations with a maximum evaluation depth of 5. Performed 310 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 40 variables. [2018-12-09 08:29:58,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:29:58,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 08:29:58,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:29:58,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/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-12-09 08:29:58,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:29:58,779 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 08:29:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:29:58,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:29:58,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-09 08:29:58,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 08:29:58,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:29:58,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:29:58,892 INFO L478 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 21 treesize of output 17 [2018-12-09 08:29:58,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 08:29:58,894 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:29:58,897 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:29:58,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:29:58,905 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:43, output treesize:5 [2018-12-09 08:29:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 08:29:58,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:29:58,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2018-12-09 08:29:58,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-09 08:29:58,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:29:58,974 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:29:58,974 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:29:58,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 08:29:58,975 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 08:29:58,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:29:58,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:29:58,979 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:13, output treesize:7 [2018-12-09 08:29:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 08:29:59,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 08:29:59,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 20 [2018-12-09 08:29:59,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 08:29:59,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 08:29:59,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 08:29:59,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-12-09 08:29:59,013 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 16 states. [2018-12-09 08:29:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:29:59,402 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2018-12-09 08:29:59,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 08:29:59,402 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-12-09 08:29:59,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:29:59,404 INFO L225 Difference]: With dead ends: 71 [2018-12-09 08:29:59,404 INFO L226 Difference]: Without dead ends: 63 [2018-12-09 08:29:59,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 08:29:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-09 08:29:59,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 35. [2018-12-09 08:29:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-09 08:29:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-12-09 08:29:59,412 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 40 [2018-12-09 08:29:59,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:29:59,412 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-12-09 08:29:59,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 08:29:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-12-09 08:29:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 08:29:59,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:29:59,413 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:29:59,413 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:29:59,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:29:59,413 INFO L82 PathProgramCache]: Analyzing trace with hash 18299409, now seen corresponding path program 2 times [2018-12-09 08:29:59,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:29:59,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:29:59,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:29:59,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:29:59,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:29:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:29:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:29:59,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:29:59,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 08:29:59,566 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 08:29:59,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 08:29:59,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:29:59,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:29:59,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 08:29:59,573 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 08:29:59,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 08:29:59,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:29:59,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:29:59,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 08:29:59,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-12-09 08:29:59,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:29:59,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:29:59,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:29:59,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:9 [2018-12-09 08:29:59,745 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 08:29:59,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:29:59,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2018-12-09 08:29:59,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-12-09 08:29:59,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:29:59,819 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:29:59,820 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:29:59,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 08:29:59,821 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 08:29:59,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:29:59,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:29:59,828 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:13, output treesize:7 [2018-12-09 08:29:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:29:59,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 08:29:59,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 28 [2018-12-09 08:29:59,898 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 08:29:59,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-09 08:29:59,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-09 08:29:59,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2018-12-09 08:29:59,898 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 24 states. [2018-12-09 08:30:00,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:30:00,242 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2018-12-09 08:30:00,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 08:30:00,242 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2018-12-09 08:30:00,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:30:00,243 INFO L225 Difference]: With dead ends: 82 [2018-12-09 08:30:00,243 INFO L226 Difference]: Without dead ends: 74 [2018-12-09 08:30:00,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 64 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=1028, Unknown=0, NotChecked=0, Total=1260 [2018-12-09 08:30:00,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-09 08:30:00,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 47. [2018-12-09 08:30:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 08:30:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2018-12-09 08:30:00,249 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 42 [2018-12-09 08:30:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:30:00,250 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-12-09 08:30:00,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-09 08:30:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2018-12-09 08:30:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 08:30:00,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:30:00,251 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:30:00,251 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:30:00,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:30:00,251 INFO L82 PathProgramCache]: Analyzing trace with hash 80339023, now seen corresponding path program 1 times [2018-12-09 08:30:00,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:30:00,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:30:00,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:30:00,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:30:00,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:30:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:30:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 08:30:00,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:30:00,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 08:30:00,318 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-12-09 08:30:00,318 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [3], [6], [8], [10], [11], [17], [19], [21], [24], [30], [35], [38], [40], [45], [48], [55], [58], [59], [60], [61], [62], [64], [65], [66], [67], [68], [69], [70], [71], [72], [73] [2018-12-09 08:30:00,320 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 08:30:00,320 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 08:30:00,375 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 08:30:00,375 INFO L272 AbstractInterpreter]: Visited 34 different actions 45 times. Merged at 1 different actions 3 times. Never widened. Performed 352 root evaluator evaluations with a maximum evaluation depth of 5. Performed 352 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 2 different actions. Largest state had 40 variables. [2018-12-09 08:30:00,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:30:00,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 08:30:00,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:30:00,377 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:30:00,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:30:00,384 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 08:30:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:30:00,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:30:00,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 08:30:00,420 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 08:30:00,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:00,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:00,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:00,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-09 08:30:00,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-09 08:30:00,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:30:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 08:30:00,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 08:30:00,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2018-12-09 08:30:00,563 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 08:30:00,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 08:30:00,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 08:30:00,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-12-09 08:30:00,564 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 16 states. [2018-12-09 08:30:00,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:30:00,758 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2018-12-09 08:30:00,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 08:30:00,759 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-12-09 08:30:00,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:30:00,759 INFO L225 Difference]: With dead ends: 82 [2018-12-09 08:30:00,759 INFO L226 Difference]: Without dead ends: 58 [2018-12-09 08:30:00,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 73 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2018-12-09 08:30:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-09 08:30:00,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2018-12-09 08:30:00,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 08:30:00,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-12-09 08:30:00,765 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 42 [2018-12-09 08:30:00,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:30:00,765 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-12-09 08:30:00,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 08:30:00,765 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-12-09 08:30:00,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 08:30:00,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:30:00,766 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:30:00,766 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:30:00,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:30:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash 293059023, now seen corresponding path program 2 times [2018-12-09 08:30:00,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 08:30:00,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:30:00,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:30:00,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 08:30:00,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 08:30:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:30:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-09 08:30:00,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:30:00,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 08:30:00,850 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 08:30:00,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 08:30:00,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:30:00,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:30:00,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 08:30:00,856 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 08:30:00,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 08:30:00,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:30:00,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:30:00,941 INFO L478 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 29 treesize of output 45 [2018-12-09 08:30:00,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 38 [2018-12-09 08:30:00,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:30:00,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 08:30:00,950 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:00,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:30:00,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 25 [2018-12-09 08:30:00,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:30:01,162 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:30:01,163 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_arrayElimArr_5 input size 12 context size 12 output size 12 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.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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-09 08:30:01,165 INFO L168 Benchmark]: Toolchain (without parser) took 3860.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 948.6 MB in the beginning and 873.2 MB in the end (delta: 75.4 MB). Peak memory consumption was 218.6 MB. Max. memory is 11.5 GB. [2018-12-09 08:30:01,166 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:30:01,166 INFO L168 Benchmark]: CACSL2BoogieTranslator took 132.63 ms. Allocated memory is still 1.0 GB. Free memory was 948.6 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 08:30:01,166 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.74 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 935.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 08:30:01,166 INFO L168 Benchmark]: Boogie Preprocessor took 53.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-12-09 08:30:01,167 INFO L168 Benchmark]: RCFGBuilder took 153.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-09 08:30:01,167 INFO L168 Benchmark]: TraceAbstraction took 3505.07 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 873.2 MB in the end (delta: 189.4 MB). Peak memory consumption was 242.9 MB. Max. memory is 11.5 GB. [2018-12-09 08:30:01,169 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 132.63 ms. Allocated memory is still 1.0 GB. Free memory was 948.6 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.74 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 935.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 153.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3505.07 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 873.2 MB in the end (delta: 189.4 MB). Peak memory consumption was 242.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_5 input size 12 context size 12 output size 12 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_5 input size 12 context size 12 output size 12: 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-635dfa2 [2018-12-09 08:30:02,381 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 08:30:02,382 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 08:30:02,388 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 08:30:02,388 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 08:30:02,388 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 08:30:02,389 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 08:30:02,390 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 08:30:02,391 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 08:30:02,391 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 08:30:02,391 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 08:30:02,392 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 08:30:02,392 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 08:30:02,392 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 08:30:02,393 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 08:30:02,393 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 08:30:02,394 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 08:30:02,395 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 08:30:02,395 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 08:30:02,396 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 08:30:02,397 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 08:30:02,397 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 08:30:02,398 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 08:30:02,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 08:30:02,398 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 08:30:02,399 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 08:30:02,399 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 08:30:02,400 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 08:30:02,400 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 08:30:02,401 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 08:30:02,401 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 08:30:02,401 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 08:30:02,401 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 08:30:02,401 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 08:30:02,402 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 08:30:02,402 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 08:30:02,402 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 08:30:02,409 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 08:30:02,409 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 08:30:02,410 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 08:30:02,410 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 08:30:02,410 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 08:30:02,410 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 08:30:02,410 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 08:30:02,410 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 08:30:02,410 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 08:30:02,410 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 08:30:02,411 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 08:30:02,411 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 08:30:02,411 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 08:30:02,411 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 08:30:02,411 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 08:30:02,411 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 08:30:02,411 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 08:30:02,411 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 08:30:02,412 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 08:30:02,412 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 08:30:02,412 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 08:30:02,412 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 08:30:02,412 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 08:30:02,412 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 08:30:02,412 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 08:30:02,412 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 08:30:02,412 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 08:30:02,412 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 08:30:02,413 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 08:30:02,413 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 08:30:02,413 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 08:30:02,413 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 08:30:02,413 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 08:30:02,413 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 08:30:02,413 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 08:30:02,413 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_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/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 -> efd11941ceab8dc56d9aa56f1950f714738654ba [2018-12-09 08:30:02,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 08:30:02,437 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 08:30:02,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 08:30:02,441 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 08:30:02,441 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 08:30:02,441 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/test22_true-unreach-call.c [2018-12-09 08:30:02,478 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/data/31eb2f516/722b22e6de3946b493088a1b5621ea2f/FLAGb902984c2 [2018-12-09 08:30:02,806 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 08:30:02,806 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/sv-benchmarks/c/ldv-regression/test22_true-unreach-call.c [2018-12-09 08:30:02,810 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/data/31eb2f516/722b22e6de3946b493088a1b5621ea2f/FLAGb902984c2 [2018-12-09 08:30:03,210 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/data/31eb2f516/722b22e6de3946b493088a1b5621ea2f [2018-12-09 08:30:03,213 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 08:30:03,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 08:30:03,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 08:30:03,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 08:30:03,219 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 08:30:03,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:30:03" (1/1) ... [2018-12-09 08:30:03,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45734aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:30:03, skipping insertion in model container [2018-12-09 08:30:03,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 08:30:03" (1/1) ... [2018-12-09 08:30:03,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 08:30:03,243 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 08:30:03,344 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:30:03,352 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 08:30:03,363 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 08:30:03,374 INFO L195 MainTranslator]: Completed translation [2018-12-09 08:30:03,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:30:03 WrapperNode [2018-12-09 08:30:03,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 08:30:03,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 08:30:03,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 08:30:03,375 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 08:30:03,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:30:03" (1/1) ... [2018-12-09 08:30:03,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:30:03" (1/1) ... [2018-12-09 08:30:03,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 08:30:03,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 08:30:03,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 08:30:03,390 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 08:30:03,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:30:03" (1/1) ... [2018-12-09 08:30:03,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:30:03" (1/1) ... [2018-12-09 08:30:03,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:30:03" (1/1) ... [2018-12-09 08:30:03,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:30:03" (1/1) ... [2018-12-09 08:30:03,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:30:03" (1/1) ... [2018-12-09 08:30:03,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:30:03" (1/1) ... [2018-12-09 08:30:03,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:30:03" (1/1) ... [2018-12-09 08:30:03,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 08:30:03,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 08:30:03,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 08:30:03,409 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 08:30:03,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:30:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/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-12-09 08:30:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-12-09 08:30:03,472 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-12-09 08:30:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 08:30:03,472 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 08:30:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-12-09 08:30:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-12-09 08:30:03,472 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-12-09 08:30:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 08:30:03,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 08:30:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 08:30:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-09 08:30:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-12-09 08:30:03,473 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-12-09 08:30:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 08:30:03,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 08:30:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-09 08:30:03,618 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 08:30:03,619 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 08:30:03,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:30:03 BoogieIcfgContainer [2018-12-09 08:30:03,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 08:30:03,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 08:30:03,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 08:30:03,621 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 08:30:03,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 08:30:03" (1/3) ... [2018-12-09 08:30:03,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed2f019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:30:03, skipping insertion in model container [2018-12-09 08:30:03,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 08:30:03" (2/3) ... [2018-12-09 08:30:03,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ed2f019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 08:30:03, skipping insertion in model container [2018-12-09 08:30:03,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:30:03" (3/3) ... [2018-12-09 08:30:03,624 INFO L112 eAbstractionObserver]: Analyzing ICFG test22_true-unreach-call.c [2018-12-09 08:30:03,631 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 08:30:03,637 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 08:30:03,646 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 08:30:03,663 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 08:30:03,664 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 08:30:03,664 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 08:30:03,664 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 08:30:03,664 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 08:30:03,664 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 08:30:03,664 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 08:30:03,664 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 08:30:03,664 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 08:30:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-12-09 08:30:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 08:30:03,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:30:03,681 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:30:03,682 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:30:03,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:30:03,686 INFO L82 PathProgramCache]: Analyzing trace with hash 80965718, now seen corresponding path program 1 times [2018-12-09 08:30:03,689 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:30:03,689 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:30:03,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:30:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:30:03,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:30:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 08:30:03,778 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 08:30:03,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:30:03,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 08:30:03,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 08:30:03,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 08:30:03,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 08:30:03,793 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2018-12-09 08:30:03,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:30:03,805 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-12-09 08:30:03,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 08:30:03,806 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-12-09 08:30:03,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:30:03,811 INFO L225 Difference]: With dead ends: 47 [2018-12-09 08:30:03,811 INFO L226 Difference]: Without dead ends: 30 [2018-12-09 08:30:03,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-12-09 08:30:03,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-09 08:30:03,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-09 08:30:03,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 08:30:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-09 08:30:03,842 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 36 [2018-12-09 08:30:03,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:30:03,843 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-09 08:30:03,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 08:30:03,843 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-12-09 08:30:03,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 08:30:03,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:30:03,845 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:30:03,845 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:30:03,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:30:03,846 INFO L82 PathProgramCache]: Analyzing trace with hash 76840485, now seen corresponding path program 1 times [2018-12-09 08:30:03,846 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:30:03,846 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:30:03,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:30:03,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:30:03,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:30:04,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-09 08:30:04,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-12-09 08:30:04,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:04,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:04,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:04,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2018-12-09 08:30:04,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 08:30:04,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:30:04,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2018-12-09 08:30:04,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 08:30:04,270 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:30:04,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-12-09 08:30:04,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:30:04,338 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:30:04,340 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:30:04,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2018-12-09 08:30:04,343 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:04,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:30:04,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:30:04,367 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2018-12-09 08:30:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:30:04,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:30:04,564 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:30:04,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:30:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:30:04,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:30:04,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-09 08:30:04,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-12-09 08:30:04,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:04,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:04,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:04,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:11 [2018-12-09 08:30:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:30:04,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:30:04,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 24 [2018-12-09 08:30:04,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-12-09 08:30:04,751 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:30:04,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-09 08:30:04,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:30:04,804 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:30:04,806 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:30:04,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2018-12-09 08:30:04,809 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:04,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:30:04,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:30:04,831 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2018-12-09 08:30:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:30:04,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 08:30:04,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11, 11] total 23 [2018-12-09 08:30:04,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-09 08:30:04,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-09 08:30:04,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-12-09 08:30:04,919 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 23 states. [2018-12-09 08:30:06,527 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-12-09 08:30:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:30:07,015 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2018-12-09 08:30:07,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 08:30:07,016 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2018-12-09 08:30:07,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:30:07,018 INFO L225 Difference]: With dead ends: 87 [2018-12-09 08:30:07,018 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 08:30:07,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=226, Invalid=1106, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 08:30:07,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 08:30:07,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 45. [2018-12-09 08:30:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 08:30:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2018-12-09 08:30:07,027 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 37 [2018-12-09 08:30:07,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:30:07,028 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2018-12-09 08:30:07,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-09 08:30:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2018-12-09 08:30:07,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 08:30:07,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:30:07,029 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:30:07,029 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:30:07,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:30:07,029 INFO L82 PathProgramCache]: Analyzing trace with hash 499542311, now seen corresponding path program 1 times [2018-12-09 08:30:07,029 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:30:07,030 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:30:07,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:30:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:30:07,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:30:07,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 08:30:07,101 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 08:30:07,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:07,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:07,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:07,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-09 08:30:07,175 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 08:30:07,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:30:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 08:30:07,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:30:07,239 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:30:07,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:30:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:30:07,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:30:07,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 08:30:07,277 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 08:30:07,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:07,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:07,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:07,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-09 08:30:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 08:30:07,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:30:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 08:30:07,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 08:30:07,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12] total 14 [2018-12-09 08:30:07,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 08:30:07,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 08:30:07,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-09 08:30:07,339 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 14 states. [2018-12-09 08:30:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:30:07,711 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2018-12-09 08:30:07,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 08:30:07,712 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-12-09 08:30:07,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:30:07,713 INFO L225 Difference]: With dead ends: 69 [2018-12-09 08:30:07,713 INFO L226 Difference]: Without dead ends: 50 [2018-12-09 08:30:07,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2018-12-09 08:30:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-09 08:30:07,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 44. [2018-12-09 08:30:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 08:30:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-12-09 08:30:07,719 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 37 [2018-12-09 08:30:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:30:07,719 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-12-09 08:30:07,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 08:30:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-12-09 08:30:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 08:30:07,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:30:07,720 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:30:07,720 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:30:07,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:30:07,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2000068519, now seen corresponding path program 2 times [2018-12-09 08:30:07,720 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:30:07,720 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:30:07,733 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 08:30:07,781 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-09 08:30:07,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:30:07,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:30:07,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-09 08:30:07,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-12-09 08:30:07,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:07,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:07,888 INFO L478 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 28 treesize of output 22 [2018-12-09 08:30:07,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-12-09 08:30:07,891 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:07,898 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:07,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:07,914 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:57, output treesize:11 [2018-12-09 08:30:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 08:30:07,933 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 08:30:07,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 08:30:07,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 08:30:07,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 08:30:07,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 08:30:07,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 08:30:07,936 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 6 states. [2018-12-09 08:30:08,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:30:08,037 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-12-09 08:30:08,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 08:30:08,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-12-09 08:30:08,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:30:08,039 INFO L225 Difference]: With dead ends: 53 [2018-12-09 08:30:08,039 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 08:30:08,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 08:30:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 08:30:08,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-12-09 08:30:08,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 08:30:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-12-09 08:30:08,046 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 37 [2018-12-09 08:30:08,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:30:08,047 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-12-09 08:30:08,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 08:30:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-12-09 08:30:08,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 08:30:08,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:30:08,048 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:30:08,048 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:30:08,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:30:08,048 INFO L82 PathProgramCache]: Analyzing trace with hash 959865804, now seen corresponding path program 1 times [2018-12-09 08:30:08,048 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:30:08,049 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:30:08,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:30:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:30:08,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:30:08,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 08:30:08,118 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 08:30:08,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:08,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:08,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:08,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-09 08:30:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 08:30:08,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:30:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 08:30:08,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:30:08,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:30:08,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:30:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:30:08,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:30:08,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-09 08:30:08,271 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-09 08:30:08,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:08,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:08,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:08,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-12-09 08:30:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 08:30:08,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:30:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 08:30:08,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 08:30:08,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12, 12] total 14 [2018-12-09 08:30:08,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 08:30:08,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 08:30:08,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-12-09 08:30:08,337 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 14 states. [2018-12-09 08:30:08,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:30:08,703 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2018-12-09 08:30:08,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 08:30:08,703 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-12-09 08:30:08,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:30:08,704 INFO L225 Difference]: With dead ends: 68 [2018-12-09 08:30:08,704 INFO L226 Difference]: Without dead ends: 52 [2018-12-09 08:30:08,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-12-09 08:30:08,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-09 08:30:08,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2018-12-09 08:30:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 08:30:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-12-09 08:30:08,709 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 39 [2018-12-09 08:30:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:30:08,709 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-12-09 08:30:08,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 08:30:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-12-09 08:30:08,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 08:30:08,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:30:08,710 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:30:08,710 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:30:08,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:30:08,710 INFO L82 PathProgramCache]: Analyzing trace with hash -845572530, now seen corresponding path program 2 times [2018-12-09 08:30:08,711 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:30:08,711 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:30:08,732 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 08:30:08,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 08:30:08,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:30:08,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:30:08,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-09 08:30:08,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-12-09 08:30:08,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:08,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:08,968 INFO L478 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 28 treesize of output 22 [2018-12-09 08:30:08,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-12-09 08:30:08,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:08,976 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:08,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:08,991 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:57, output treesize:11 [2018-12-09 08:30:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 08:30:09,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:30:09,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-12-09 08:30:09,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-12-09 08:30:09,283 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:30:09,334 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:30:09,339 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:30:09,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-12-09 08:30:09,342 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:09,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-09 08:30:09,365 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:30:09,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:30:09,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:30:09,392 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:38, output treesize:13 [2018-12-09 08:30:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 08:30:09,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:30:09,440 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:30:09,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 08:30:09,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 08:30:09,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:30:09,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:30:09,641 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-09 08:30:09,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2018-12-09 08:30:09,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-12-09 08:30:09,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:30:09,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2018-12-09 08:30:09,661 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:09,681 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:09,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-12-09 08:30:09,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:30:09,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 44 [2018-12-09 08:30:09,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:30:09,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:30:09,797 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:30:09,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 45 [2018-12-09 08:30:09,803 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:09,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:30:09,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:30:10,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 59 [2018-12-09 08:30:10,005 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-09 08:30:10,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:30:10,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:30:10,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:30:10,221 INFO L478 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 26 treesize of output 47 [2018-12-09 08:30:10,222 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:10,295 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-09 08:30:10,370 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-09 08:30:10,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 08:30:10,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2018-12-09 08:30:10,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-09 08:30:10,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:30:10,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 08:30:10,488 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:10,503 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:10,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-12-09 08:30:10,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-12-09 08:30:10,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 08:30:10,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-12-09 08:30:10,564 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:10,577 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:10,597 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:10,618 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:10,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:10,711 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:42, output treesize:1 [2018-12-09 08:30:11,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-09 08:30:11,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-12-09 08:30:11,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:11,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:11,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:11,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:11 [2018-12-09 08:30:11,235 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:30:11,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:30:11,783 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2018-12-09 08:30:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 08:30:12,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 08:30:12,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 13, 15] total 32 [2018-12-09 08:30:12,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-09 08:30:12,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-09 08:30:12,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2018-12-09 08:30:12,349 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 32 states. [2018-12-09 08:30:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:30:15,525 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2018-12-09 08:30:15,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-09 08:30:15,526 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 39 [2018-12-09 08:30:15,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:30:15,527 INFO L225 Difference]: With dead ends: 69 [2018-12-09 08:30:15,527 INFO L226 Difference]: Without dead ends: 62 [2018-12-09 08:30:15,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 123 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=406, Invalid=2350, Unknown=0, NotChecked=0, Total=2756 [2018-12-09 08:30:15,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-09 08:30:15,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-12-09 08:30:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 08:30:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-09 08:30:15,534 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 39 [2018-12-09 08:30:15,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:30:15,534 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-09 08:30:15,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-09 08:30:15,534 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-09 08:30:15,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 08:30:15,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:30:15,535 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:30:15,535 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:30:15,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:30:15,535 INFO L82 PathProgramCache]: Analyzing trace with hash 344895801, now seen corresponding path program 1 times [2018-12-09 08:30:15,535 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:30:15,535 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:30:15,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 08:30:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:30:15,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:30:16,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-09 08:30:16,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-09 08:30:16,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:16,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:16,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:16,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:14 [2018-12-09 08:30:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 08:30:16,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:30:16,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-12-09 08:30:16,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2018-12-09 08:30:16,972 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:30:17,030 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:30:17,034 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:30:17,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-12-09 08:30:17,037 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:17,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-09 08:30:17,065 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:30:17,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:30:17,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:30:17,092 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:36, output treesize:7 [2018-12-09 08:30:17,435 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:30:17,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:30:17,437 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:30:17,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 08:30:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 08:30:17,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:30:18,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-09 08:30:18,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-12-09 08:30:18,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:18,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:18,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 08:30:18,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:11 [2018-12-09 08:30:18,797 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:30:18,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:30:19,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 44 [2018-12-09 08:30:19,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-12-09 08:30:19,502 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:30:19,604 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:30:19,609 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:30:19,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-12-09 08:30:19,613 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 08:30:19,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-09 08:30:19,639 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:30:19,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:30:19,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:30:19,667 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:7 [2018-12-09 08:30:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 08:30:19,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 08:30:19,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17, 17] total 44 [2018-12-09 08:30:19,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-09 08:30:19,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-09 08:30:19,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=1648, Unknown=0, NotChecked=0, Total=1892 [2018-12-09 08:30:19,738 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 44 states. [2018-12-09 08:30:25,284 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2018-12-09 08:30:25,875 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2018-12-09 08:30:26,399 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-12-09 08:30:26,967 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 30 [2018-12-09 08:30:28,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:30:28,840 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2018-12-09 08:30:28,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-09 08:30:28,840 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 45 [2018-12-09 08:30:28,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:30:28,841 INFO L225 Difference]: With dead ends: 83 [2018-12-09 08:30:28,841 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 08:30:28,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 134 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1226 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=951, Invalid=4599, Unknown=0, NotChecked=0, Total=5550 [2018-12-09 08:30:28,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 08:30:28,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 60. [2018-12-09 08:30:28,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-09 08:30:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2018-12-09 08:30:28,853 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 45 [2018-12-09 08:30:28,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:30:28,853 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2018-12-09 08:30:28,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-09 08:30:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2018-12-09 08:30:28,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 08:30:28,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 08:30:28,855 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 08:30:28,855 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 08:30:28,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 08:30:28,855 INFO L82 PathProgramCache]: Analyzing trace with hash 837914722, now seen corresponding path program 3 times [2018-12-09 08:30:28,855 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 08:30:28,855 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 08:30:28,869 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-09 08:30:28,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 08:30:28,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:30:28,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:30:37,025 WARN L180 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 32 [2018-12-09 08:30:54,455 WARN L180 SmtUtils]: Spent 17.38 s on a formula simplification that was a NOOP. DAG size: 47 [2018-12-09 08:30:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 08:30:58,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:30:59,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2018-12-09 08:30:59,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-12-09 08:30:59,402 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:30:59,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-12-09 08:30:59,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:30:59,569 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:30:59,584 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:30:59,585 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-12-09 08:30:59,586 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 08:30:59,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 08:30:59,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:30:59,738 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2018-12-09 08:30:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-09 08:30:59,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 08:30:59,819 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 08:30:59,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 08:30:59,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 08:30:59,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 08:30:59,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 08:31:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 08:31:23,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 08:31:23,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2018-12-09 08:31:23,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-12-09 08:31:23,391 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:31:23,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-12-09 08:31:23,439 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 08:31:23,518 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:31:23,531 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 08:31:23,532 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2018-12-09 08:31:23,533 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 08:31:23,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-09 08:31:23,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 08:31:23,664 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:7 [2018-12-09 08:31:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 08:31:23,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 08:31:23,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 17, 16] total 35 [2018-12-09 08:31:23,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-09 08:31:23,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-09 08:31:23,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1054, Unknown=5, NotChecked=0, Total=1190 [2018-12-09 08:31:23,735 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 35 states. [2018-12-09 08:31:54,556 WARN L180 SmtUtils]: Spent 7.38 s on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2018-12-09 08:31:54,909 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2018-12-09 08:31:55,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 08:31:55,810 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-12-09 08:31:55,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 08:31:55,810 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 47 [2018-12-09 08:31:55,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 08:31:55,810 INFO L225 Difference]: With dead ends: 74 [2018-12-09 08:31:55,810 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 08:31:55,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 151 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 73.6s TimeCoverageRelationStatistics Valid=333, Invalid=1914, Unknown=9, NotChecked=0, Total=2256 [2018-12-09 08:31:55,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 08:31:55,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 08:31:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 08:31:55,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 08:31:55,811 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2018-12-09 08:31:55,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 08:31:55,812 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 08:31:55,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-09 08:31:55,812 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 08:31:55,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 08:31:55,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 08:31:55,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 08:31:55,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 08:31:56,289 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2018-12-09 08:31:59,471 WARN L180 SmtUtils]: Spent 3.18 s on a formula simplification. DAG size of input: 123 DAG size of output: 35 [2018-12-09 08:32:04,138 WARN L180 SmtUtils]: Spent 4.66 s on a formula simplification. DAG size of input: 50 DAG size of output: 1 [2018-12-09 08:32:04,246 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-12-09 08:32:04,295 INFO L448 ceAbstractionStarter]: For program point initEXIT(lines 11 18) no Hoare annotation was computed. [2018-12-09 08:32:04,295 INFO L451 ceAbstractionStarter]: At program point initENTRY(lines 11 18) the Hoare annotation is: true [2018-12-09 08:32:04,296 INFO L448 ceAbstractionStarter]: For program point initFINAL(lines 11 18) no Hoare annotation was computed. [2018-12-09 08:32:04,296 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 08:32:04,296 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-09 08:32:04,296 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 08:32:04,296 INFO L448 ceAbstractionStarter]: For program point get_dummyFINAL(lines 20 23) no Hoare annotation was computed. [2018-12-09 08:32:04,296 INFO L451 ceAbstractionStarter]: At program point get_dummyENTRY(lines 20 23) the Hoare annotation is: true [2018-12-09 08:32:04,296 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-12-09 08:32:04,296 INFO L448 ceAbstractionStarter]: For program point get_dummyEXIT(lines 20 23) no Hoare annotation was computed. [2018-12-09 08:32:04,296 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 08:32:04,296 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= |~#d1~0.base| |~#d2~0.base|)) (= (_ bv0 32) |~#d1~0.offset|)) [2018-12-09 08:32:04,296 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 08:32:04,296 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 08:32:04,296 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-12-09 08:32:04,296 INFO L448 ceAbstractionStarter]: For program point L35-2(lines 35 44) no Hoare annotation was computed. [2018-12-09 08:32:04,296 INFO L444 ceAbstractionStarter]: At program point L33-1(line 33) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= (_ bv0 32) |~#d1~0.offset|)) (and (= main_~pd1~0.base |~#d2~0.base|) (= main_~pd1~0.offset |~#d2~0.offset|)) (and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))) [2018-12-09 08:32:04,296 INFO L448 ceAbstractionStarter]: For program point L33-2(line 33) no Hoare annotation was computed. [2018-12-09 08:32:04,296 INFO L448 ceAbstractionStarter]: For program point L35-4(lines 35 44) no Hoare annotation was computed. [2018-12-09 08:32:04,297 INFO L444 ceAbstractionStarter]: At program point L33-3(line 33) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= main_~pd2~0.base main_~pd1~0.base)) (let ((.cse0 (= main_~pd1~0.offset main_~pd2~0.offset))) (or (and .cse0 (= main_~pd1~0.base |~#d2~0.base|) (= main_~pd1~0.offset |~#d2~0.offset|)) (and (= |~#d1~0.base| main_~pd1~0.base) .cse0 (= main_~pd1~0.offset |~#d1~0.offset|)))) (not (= (_ bv0 32) |~#d1~0.offset|))) [2018-12-09 08:32:04,297 INFO L448 ceAbstractionStarter]: For program point L33-4(line 33) no Hoare annotation was computed. [2018-12-09 08:32:04,297 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 30 50) no Hoare annotation was computed. [2018-12-09 08:32:04,297 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 30 50) no Hoare annotation was computed. [2018-12-09 08:32:04,297 INFO L444 ceAbstractionStarter]: At program point L42(lines 31 50) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= (_ bv0 32) |~#d1~0.offset|))) [2018-12-09 08:32:04,297 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 38 40) no Hoare annotation was computed. [2018-12-09 08:32:04,297 INFO L444 ceAbstractionStarter]: At program point L38-3(lines 38 40) the Hoare annotation is: (or (and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pd2~0.offset main_~pa~0.offset) (= main_~pd2~0.base main_~pa~0.base) (and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset main_~pd2~0.offset)) (or (not (= (_ bv0 32) main_~pa~0.base)) (not (= (_ bv0 32) main_~pa~0.offset))) (bvsgt (select (select |#memory_int| main_~pd2~0.base) main_~pd2~0.offset) (_ bv0 32))) (not (= (_ bv0 32) |~#d1~0.offset|)) (= |~#d1~0.base| |~#d2~0.base|)) [2018-12-09 08:32:04,297 INFO L444 ceAbstractionStarter]: At program point L38-4(lines 38 40) the Hoare annotation is: (or (= |~#d1~0.base| |~#d2~0.base|) (not (= (_ bv0 32) |~#d1~0.offset|)) (let ((.cse0 (select (select |#memory_int| main_~pd2~0.base) main_~pd2~0.offset))) (and (= main_~pd2~0.offset main_~pa~0.offset) (= main_~pd2~0.base main_~pa~0.base) (and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset main_~pd2~0.offset)) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) .cse0) (bvsgt .cse0 (_ bv0 32)) (or (not (= main_~pd2~0.base (_ bv0 32))) (not (= main_~pd2~0.offset (_ bv0 32)))) (not (bvslt main_~i~0 .cse0))))) [2018-12-09 08:32:04,297 INFO L451 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: true [2018-12-09 08:32:04,297 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 30 50) the Hoare annotation is: true [2018-12-09 08:32:04,297 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2018-12-09 08:32:04,297 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-12-09 08:32:04,297 INFO L448 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2018-12-09 08:32:04,297 INFO L451 ceAbstractionStarter]: At program point checkENTRY(lines 25 28) the Hoare annotation is: true [2018-12-09 08:32:04,297 INFO L448 ceAbstractionStarter]: For program point checkFINAL(lines 25 28) no Hoare annotation was computed. [2018-12-09 08:32:04,298 INFO L448 ceAbstractionStarter]: For program point checkEXIT(lines 25 28) no Hoare annotation was computed. [2018-12-09 08:32:04,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:32:04,303 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:32:04,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:32:04,307 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:32:04,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 08:32:04 BoogieIcfgContainer [2018-12-09 08:32:04,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 08:32:04,309 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 08:32:04,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 08:32:04,309 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 08:32:04,309 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 08:30:03" (3/4) ... [2018-12-09 08:32:04,312 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 08:32:04,316 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init [2018-12-09 08:32:04,316 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 08:32:04,316 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure get_dummy [2018-12-09 08:32:04,316 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 08:32:04,316 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure check [2018-12-09 08:32:04,320 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-12-09 08:32:04,320 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-09 08:32:04,320 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 08:32:04,321 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 08:32:04,350 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2f4fccad-45c4-4c74-a563-75e5ac5dc9e2/bin-2019/utaipan/witness.graphml [2018-12-09 08:32:04,350 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 08:32:04,351 INFO L168 Benchmark]: Toolchain (without parser) took 121136.81 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 305.7 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -150.4 MB). Peak memory consumption was 155.3 MB. Max. memory is 11.5 GB. [2018-12-09 08:32:04,351 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:32:04,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.85 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 931.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 08:32:04,351 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.05 ms. Allocated memory is still 1.0 GB. Free memory was 931.3 MB in the beginning and 925.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 08:32:04,352 INFO L168 Benchmark]: Boogie Preprocessor took 18.22 ms. Allocated memory is still 1.0 GB. Free memory is still 925.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:32:04,352 INFO L168 Benchmark]: RCFGBuilder took 210.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-12-09 08:32:04,352 INFO L168 Benchmark]: TraceAbstraction took 120689.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.6 MB). Peak memory consumption was 177.3 MB. Max. memory is 11.5 GB. [2018-12-09 08:32:04,352 INFO L168 Benchmark]: Witness Printer took 41.06 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 08:32:04,353 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 158.85 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 931.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.05 ms. Allocated memory is still 1.0 GB. Free memory was 931.3 MB in the beginning and 925.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.22 ms. Allocated memory is still 1.0 GB. Free memory is still 925.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 210.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -168.1 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 120689.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.6 MB). Peak memory consumption was 177.3 MB. Max. memory is 11.5 GB. * Witness Printer took 41.06 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant [2018-12-09 08:32:04,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:32:04,355 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:32:04,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 08:32:04,356 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((~bvslt32(~bvadd64(i, 4294967295bv32), unknown-#memory_int-unknown[pa][pa]) && pd2 == pa) && pd2 == pa) && pd2 == pd1 && pd1 == pd2) && (!(0bv32 == pa) || !(0bv32 == pa))) && ~bvsgt32(unknown-#memory_int-unknown[pd2][pd2], 0bv32)) || !(0bv32 == d1)) || d1 == d2 - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: d1 == d2 || !(0bv32 == d1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. SAFE Result, 120.6s OverallTime, 8 OverallIterations, 6 TraceHistogramMax, 47.3s AutomataDifference, 0.0s DeadEndRemovalTime, 8.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 271 SDtfs, 317 SDslu, 2308 SDs, 0 SdLazy, 2593 SolverSat, 247 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 15.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1132 GetRequests, 872 SyntacticMatches, 10 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2592 ImplicationChecksByTransitivity, 90.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 86 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 27 PreInvPairs, 50 NumberOfFragments, 180 HoareAnnotationTreeSize, 27 FomulaSimplifications, 27947 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 2859 FormulaSimplificationTreeSizeReductionInter, 8.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 63.6s InterpolantComputationTime, 561 NumberOfCodeBlocks, 537 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1023 ConstructedInterpolants, 31 QuantifiedInterpolants, 272367 SizeOfPredicates, 153 NumberOfNonLiveVariables, 1519 ConjunctsInSsa, 272 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 243/528 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...